System and method for cleaning noisy genetic data and determining chromosome copy number

ABSTRACT

Disclosed herein is a system and method for increasing the fidelity of measured genetic data, for making allele calls, and for determining the state of aneuploidy, in one or a small set of cells, or from fragmentary DNA, where a limited quantity of genetic data is available. Poorly or incorrectly measured base pairs, missing alleles and missing regions are reconstructed using expected similarities between the target genome and the genome of genetically related individuals. In accordance with one embodiment, incomplete genetic data from an embryonic cell are reconstructed at a plurality of loci using the more complete genetic data from a larger sample of diploid cells from one or both parents, with or without haploid genetic data from one or both parents. In another embodiment, the chromosome copy number can be determined from the measured genetic data, with or without genetic information from one or both parents.

CROSS-REFERENCES TO RELATED APPLICATIONS

This application is a continuation of U.S. application Ser. No. 12/076,348, filed Mar. 17, 2008; which is a continuation-in-part of U.S. application Ser. No. 11/496,982, filed Jul. 31, 2006; a continuation-in-part of U.S. application Ser. No. 11/603,406, filed Nov. 22, 2006; and a continuation-in-part of U.S. application Ser. No. 11/634,550, filed Dec. 6, 2006; which claims the benefit of U.S. 60/846,610, filed Sep. 22, 2006; U.S. 60/817,741, filed Jun. 30, 2006; U.S. 60/789,506, filed Apr. 4, 2006; U.S. 60/774,976, filed Feb. 21, 2006; U.S. 60/754,396, filed Dec. 29, 2005; U.S. 60/742,305, filed Dec. 6, 2005; the disclosures thereof are incorporated by reference herein in their entirety. U.S. patent application Ser. No. 12/076,348 also claims the benefit of priority to U.S. 60/918,292, filed Mar. 16, 2007; U.S. 60/926,198, filed Apr. 25, 2007; U.S. 60/932,456, filed May 31, 2007; U.S. 60/934,441, filed Jun. 11, 2007; U.S. 61/003,101, filed Nov. 12, 2007; and U.S. 61/008,637, filed Dec. 21, 2007; the disclosures thereof are incorporated by reference herein in their entirety. U.S. application Ser. No. 11/496,982 claims the benefit of priority to U.S. 60/703,415, filed Jul. 29, 2005; and U.S. application Ser. No. 11/603,406 claims the benefit of priority to U.S. 60/739,882, filed Nov. 26, 2005; the disclosures thereof are incorporated by reference herein in their entirety.

GOVERNMENT LICENSING RIGHTS

This invention was made with government support under Grant No. R44HD054958-02A2 awarded by the National Institutes of Health. The government has certain rights in the invention.

BACKGROUND OF THE INVENTION

1. Field of the Invention

The invention relates generally to the field of acquiring, manipulating and using genetic data for medically predictive purposes, and specifically to a system in which imperfectly measured genetic data of a target individual are made more accurate by using known genetic data of genetically related individuals, thereby allowing more effective identification of genetic variations, specifically aneuploidy and disease linked genes, that could result in various phenotypic outcomes.

2. Description of the Related Art

In 2006, across the globe, roughly 800,000 in vitro fertilization (IVF) cycles were run. Of the roughly 150,000 cycles run in the US, about 10,000 involved pre-implantation genetic diagnosis (PGD). Current PGD techniques are unregulated, expensive and highly unreliable: error rates for screening disease-linked loci or aneuploidy are on the order of 10%, each screening test costs roughly $5,000, and a couple is forced to choose between testing aneuploidy, which afflicts roughly 50% of IVF embryos, or screening for disease-linked loci on the single cell. There is a great need for an affordable technology that can reliably determine genetic data from a single cell in order to screen in parallel for aneuploidy, monogenic diseases such as Cystic Fibrosis, and susceptibility to complex disease phenotypes for which the multiple genetic markers are known through whole-genome association studies.

Most PGD today focuses on high-level chromosomal abnormalities such as aneuploidy and balanced translocations with the primary outcomes being successful implantation and a take-home baby. The other main focus of PGD is for genetic disease screening, with the primary outcome being a healthy baby not afflicted with a genetically heritable disease for which one or both parents are carriers. In both cases, the likelihood of the desired outcome is enhanced by excluding genetically suboptimal embryos from transfer and implantation in the mother.

The process of PGD during IVF currently involves extracting a single cell from the roughly eight cells of an early-stage embryo for analysis. Isolation of single cells from human embryos, while highly technical, is now routine in IVF clinics. Both polar bodies and blastomeres have been isolated with success. The most common technique is to remove single blastomeres from day 3 embryos (6 or 8 cell stage). Embryos are transferred to a special cell culture medium (standard culture medium lacking calcium and magnesium), and a hole is introduced into the zona pellucida using an acidic solution, laser, or mechanical techniques. The technician then uses a biopsy pipette to remove a single blastomere with a visible nucleus. Features of the DNA of the single (or occasionally multiple) blastomere are measured using a variety of techniques. Since only a single copy of the DNA is available from one cell, direct measurements of the DNA are highly error-prone, or noisy. There is a great need for a technique that can correct, or make more accurate, these noisy genetic measurements.

Normal humans have two sets of 23 chromosomes in every diploid cell, with one copy coming from each parent. Aneuploidy, the state of a cell with extra or missing chromosome(s), and uniparental disomy, the state of a cell with two of a given chromosome both of which originate from one parent, are believed to be responsible for a large percentage of failed implantations and miscarriages, and some genetic diseases. When only certain cells in an individual are aneuploid, the individual is said to exhibit mosaicism. Detection of chromosomal abnormalities can identify individuals or embryos with conditions such as Down syndrome, Klinefelter's syndrome, and Turner syndrome, among others, in addition to increasing the chances of a successful pregnancy. Testing for chromosomal abnormalities is especially important as the age of a potential mother increases: between the ages of 35 and 40 it is estimated that between 40% and 50% of the embryos are abnormal, and above the age of 40, more than half of the embryos are like to be abnormal. The main cause of aneuploidy is nondisjunction during meiosis. Maternal nondisjunction constitutes 88% of all nondisjunction of which 65% occurs in meiosis 1 and 23% in meiosis II. Common types of human aneuploidy include trisomy from meiosis I nondisjunction, monosomy, and uniparental disomy. In a particular type of trisomy that arises in meiosis II nondisjunction, or M2 trisomy, an extra chromosome is identical to one of the two normal chromosomes. M2 trisomy is particularly difficult to detect. There is a great need for a better method that can detect for many or all types of aneuploidy at most or all of the chromosomes efficiently and with high accuracy.

Karyotyping, the traditional method used for the prediction of aneuploidy and mosaicism is giving way to other more high-throughput, more cost effective methods such as Flow Cytometry (FC) and fluorescent in situ hybridization (FISH). Currently, the vast majority of prenatal diagnoses use FISH, which can determine large chromosomal aberrations and PCR/electrophoresis, and which can determine a handful of SNPs or other allele calls. One advantage of FISH is that it is less expensive than karyotyping, but the technique is complex and expensive enough that generally a small selection of chromosomes are tested (usually chromosomes 13, 18, 21, X, Y; also sometimes 8, 9, 15, 16, 17, 22); in addition, FISH has a low level of specificity. Roughly seventy-five percent of PGD today measures high-level chromosomal abnormalities such as aneuploidy using FISH with error rates on the order of 10-15%. There is a great demand for an aneuploidy screening method that has a higher throughput, lower cost, and greater accuracy.

The number of known disease associated genetic alleles is currently at 389 according to OMIM and steadily climbing. Consequently, it is becoming increasingly relevant to analyze multiple positions on the embryonic DNA, or loci, that are associated with particular phenotypes. A clear advantage of pre-implantation genetic diagnosis over prenatal diagnosis is that it avoids some of the ethical issues regarding possible choices of action once undesirable phenotypes have been detected. A need exists for a method for more extensive genotyping of embryos at the pre-implantation stage.

There are a number of advanced technologies that enable the diagnosis of genetic aberrations at one or a few loci at the single-cell level. These include interphase chromosome conversion, comparative genomic hybridization, fluorescent PCR, mini-sequencing and whole genome amplification. The reliability of the data generated by all of these techniques relies on the quality of the DNA preparation. Better methods for the preparation of single-cell DNA for amplification and PGD are therefore needed and are under study. All genotyping techniques, when used on single cells, small numbers of cells, or fragments of DNA, suffer from integrity issues, most notably allele drop out (ADO). This is exacerbated in the context of in-vitro fertilization since the efficiency of the hybridization reaction is low, and the technique must operate quickly in order to genotype the embryo within the time period of maximal embryo viability. There exists a great need for a method that alleviates the problem of a high ADO rate when measuring genetic data from one or a small number of cells, especially when time constraints exist.

Listed here is a set of prior art which is related to the field of the current invention. None of this prior art contains or in any way refers to the novel elements of the current invention. In U.S. Pat. No. 6,489,135 Parrott et al. provide methods for determining various biological characteristics of in vitro fertilized embryos, including overall embryo health, implantability, and increased likelihood of developing successfully to term by analyzing media specimens of in vitro fertilization cultures for levels of bioactive lipids in order to determine these characteristics. In US Patent Application 20040033596 Threadgill et al. describe a method for preparing homozygous cellular libraries useful for in vitro phenotyping and gene mapping involving site-specific mitotic recombination in a plurality of isolated parent cells. In U.S. Pat. No. 5,635,366 Cooke et al. provide a method for predicting the outcome of IVF by determining the level of 11β-hydroxysteroid dehydrogenase (11β-HSD) in a biological sample from a female patient. In U.S. Pat. No. 7,058,517 Denton et al. describe a method wherein an individual's haplotypes are compared to a known database of haplotypes in the general population to predict clinical response to a treatment. In U.S. Pat. No. 7,035,739 Schadt at al. describe a method is described wherein a genetic marker map is constructed and the individual genes and traits are analyzed to give a gene-trait locus data, which are then clustered as a way to identify genetically interacting pathways, which are validated using multivariate analysis. In US Patent Application US 2004/0137470 A1, Dhallan et al. describe using primers especially selected so as to improve the amplification rate, and detection of, a large number of pertinent disease related loci, and a method of more efficiently quantitating the absence, presence and/or amount of each of those genes. In World Patent Application WO 03/031646, Findlay et al. describe a method to use an improved selection of genetic markers such that amplification of the limited amount of genetic material will give more uniformly amplified material, and it can be genotyped with higher fidelity.

SUMMARY OF THE INVENTION

The system disclosed enables the cleaning of incomplete or noisy genetic data using secondary genetic data as a source of information, and also the determination of chromosome copy number using said genetic data. While the disclosure focuses on genetic data from human subjects, and more specifically on as-yet not implanted embryos or developing fetuses, as well as related individuals, it should be noted that the methods disclosed apply to the genetic data of a range of organisms, in a range of contexts. The techniques described for cleaning genetic data are most relevant in the context of pre-implantation diagnosis during in-vitro fertilization, prenatal diagnosis in conjunction with amniocentesis, chorion villus biopsy, fetal tissue sampling, and non-invasive prenatal diagnosis, where a small quantity of fetal genetic material is isolated from maternal blood. The use of this method may facilitate diagnoses focusing on inheritable diseases, chromosome copy number predictions, increased likelihoods of defects or abnormalities, as well as making predictions of susceptibility to various disease- and non-disease phenotypes for individuals to enhance clinical and lifestyle decisions. The invention addresses the shortcomings of prior art that are discussed above.

In one aspect of the invention, methods make use of knowledge of the genetic data of the mother and the father such as diploid tissue samples, sperm from the father, haploid samples from the mother or other embryos derived from the mother's and father's gametes, together with the knowledge of the mechanism of meiosis and the imperfect measurement of the embryonic DNA, in order to reconstruct, in silico, the embryonic DNA at the location of key loci with a high degree of confidence. In one aspect of the invention, genetic data derived from other related individuals, such as other embryos, brothers and sisters, grandparents or other relatives can also be used to increase the fidelity of the reconstructed embryonic DNA. It is important to note that the parental and other secondary genetic data allows the reconstruction not only of SNPs that were measured poorly, but also of insertions, deletions, and of SNPs or whole regions of DNA that were not measured at all.

In one aspect of the invention, the fetal or embryonic genomic data which has been reconstructed, with or without the use of genetic data from related individuals, can be used to detect if the cell is aneuploid, that is, where fewer or more than two of a particular chromosome is present in a cell. The reconstructed data can also be used to detect for uniparental disomy, a condition in which two of a given chromosome are present, both of which originate from one parent. This is done by creating a set of hypotheses about the potential states of the DNA, and testing to see which hypothesis has the highest probability of being true given the measured data. Note that the use of high throughput genotyping data for screening for aneuploidy enables a single blastomere from each embryo to be used both to measure multiple disease-linked loci as well as to screen for aneuploidy.

In another aspect of the invention, the direct measurements of the amount of genetic material, amplified or unamplified, present at a plurality of loci, can be used to detect for monosomy, uniparental disomy, trisomy and other aneuploidy states. The idea behind this method is that measuring the amount of genetic material at multiple loci will give a statistically significant result.

In another aspect of the invention, the measurements, direct or indirect, of a particular subset of SNPs, namely those loci where the parents are both homozygous but with different allele values, can be used to detect for chromosomal abnormalities by looking at the ratios of maternally versus paternally miscalled homozygous loci on the embryo. The idea behind this method is that those loci where each parent is homozygous, but have different alleles, by definition result in a heterozygous loci on the embryo. Allele drop outs at those loci are random, and a shift in the ratio of loci miscalled as homozygous can only be due to incorrect chromosome number.

It will be recognized by a person of ordinary skill in the art, given the benefit of this disclosure, that various aspects and embodiments of this disclosure may implemented in combination or separately.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT Conceptual Overview of the System

The goal of the disclosed system is to provide highly accurate genomic data for the purpose of genetic diagnoses. In cases where the genetic data of an individual contains a significant amount of noise, or errors, the disclosed system makes use of the expected similarities between the genetic data of the target individual and the genetic data of related individuals, to clean the noise in the target genome. This is done by determining which segments of chromosomes of related individuals were involved in gamete formation and, when necessary where crossovers may have occurred during meiosis, and therefore which segments of the genomes of related individuals are expected to be nearly identical to sections of the target genome. In certain situations this method can be used to clean noisy base pair measurements on the target individual, but it also can be used to infer the identity of individual base pairs or whole regions of DNA that were not measured. It can also be used to determine the number of copies of a given chromosome segment in the target individual. In addition, a confidence may be computed for each call made. A highly simplified explanation is presented first, making unrealistic assumptions in order to illustrate the concept of the invention. A detailed statistical approach that can be applied to the technology of today is presented afterward.

In one aspect of the invention, the target individual is an embryo, and the purpose of applying the disclosed method to the genetic data of the embryo is to allow a doctor or other agent to make an informed choice of which embryo(s) should be implanted during IVF. In another aspect of the invention, the target individual is a fetus, and the purpose of applying the disclosed method to genetic data of the fetus is to allow a doctor or other agent to make an informed choice about possible clinical decisions or other actions to be taken with respect to the fetus.

DEFINITIONS

-   SNP (Single Nucleotide Polymorphism): a single nucleotide that may     differ between the genomes of two members of the same species. In     our usage of the term, we do not set any limit on the frequency with     which each variant occurs. -   To call a SNP: to make a decision about the true state of a     particular base pair, taking into account the direct and indirect     evidence. -   Locus: a particular region of interest on the DNA of an individual,     which may refer to a SNP, the site of a possible insertion or     deletion, or the site of some other relevant genetic variation.     Disease-linked SNPs may also refer to disease-linked loci. -   To call an allele: to determine the state of a particular locus of     DNA. This may involve calling a SNP, or determining whether or not     an insertion or deletion is present at that locus, or determining     the number of insertions that may be present at that locus, or     determining whether some other genetic variant is present at that     locus. -   Correct allele call: An allele call that correctly reflects the true     state of the actual genetic material of an individual. -   To clean genetic data: to take imperfect genetic data and correct     some or all of the errors or fill in missing data at one or more     loci. In the context of this disclosure, this involves using genetic     data of related individuals and the method described herein. -   To increase the fidelity of allele calls: to clean genetic data. -   Imperfect genetic data: genetic data with any of the following:     allele dropouts, uncertain base pair measurements, incorrect base     pair measurements, missing base pair measurements, uncertain     measurements of insertions or deletions, uncertain measurements of     chromosome segment copy numbers, spurious signals, missing     measurements, other errors, or combinations thereof. -   Noisy genetic data: imperfect genetic data, also called incomplete     genetic data. -   Uncleaned genetic data: genetic data as measured, that is, where no     method has been used to correct for the presence of noise or errors     in the raw genetic data; also called crude genetic data. -   Confidence: the statistical likelihood that the called SNP, allele,     set of alleles, or determined number of chromosome segment copies     correctly represents the real genetic state of the individual. -   Parental Support (PS): a name sometimes used for the any of the     methods disclosed herein, where the genetic information of related     individuals is used to determine the genetic state of target     individuals. In some cases, it refers specifically to the allele     calling method, sometimes to the method used for cleaning genetic     data, sometimes to the method to determine the number of copies of a     segment of a chromosome, and sometimes to some or all of these     methods used in combination. -   Copy Number Calling (CNC): the name given to the method described in     this disclosure used to determine the number of chromosome segments     in a cell. -   Qualitative CNC (also qCNC): the name given to the method in this     disclosure used to determine chromosome copy number in a cell that     makes use of qualitative measured genetic data of the target     individual and of related individuals. -   Multigenic: affected by multiple genes, or alleles. -   Direct relation: mother, father, son, or daughter. -   Chromosomal Region: a segment of a chromosome, or a full chromosome. -   Segment of a Chromosome: a section of a chromosome that can range in     size from one base pair to the entire chromosome. -   Section: a section of a chromosome. Section and segment can be used     interchangeably. -   Chromosome: may refer to either a full chromosome, or also a segment     or section of a chromosome. -   Copies: the number of copies of a chromosome segment may refer to     identical copies, or it may refer to non-identical copies of a     chromosome segment wherein the different copies of the chromosome     segment contain a substantially similar set of loci, and where one     or more of the alleles are different. Note that in some cases of     aneuploidy, such as the M2 copy error, it is possible to have some     copies of the given chromosome segment that are identical as well as     some copies of the same chromosome segment that are not identical. -   Haplotypic Data: also called ‘phased data’ or ‘ordered genetic     data;’ data from a single chromosome in a diploid or polyploid     genome, i.e., either the segregated maternal or paternal copy of a     chromosome in a diploid genome. -   Unordered Genetic Data: pooled data derived from measurements on two     or more chromosomes in a diploid or polyploid genome, i.e., both the     maternal and paternal copies of a chromosome in a diploid genome. -   Genetic data ‘in’, ‘of’, ‘at’ or ‘on’ an individual: These phrases     all refer to the data describing aspects of the genome of an     individual. It may refer to one or a set of loci, partial or entire     sequences, partial or entire chromosomes, or the entire genome. -   Hypothesis: a set of possible copy numbers of a given set of     chromosomes, or a set of possible genotypes at a given set of loci.     The set of possibilities may contain one or more elements. -   Target Individual: the individual whose genetic data is being     determined. Typically, only a limited amount of DNA is available     from the target individual. In one context, the target individual is     an embryo or a fetus. -   Related Individual: any individual who is genetically related, and     thus shares haplotype blocks, with the target individual. -   Platform response: a mathematical characterization of the     input/output characteristics of a genetic measurement platform, such     as TAQMAN or INFINIUM. The input to the channel is the true     underlying genotypes of the genetic loci being measured. The channel     output could be allele calls (qualitative) or raw numerical     measurements (quantitative), depending on the context. For example,     in the case in which the platform's raw numeric output is reduced to     qualitative genotype calls, the platform response consists of an     error transition matrix that describes the conditional probability     of seeing a particular output genotype call given a particular true     genotype input. In the case in which the platform's output is left     as raw numeric measurements, the platform response is a conditional     probability density function that describes the probability of the     numeric outputs given a particular true genotype input. -   Copy number hypothesis: a hypothesis about how many copies of a     particular chromosome segment are in the embryo. In a preferred     embodiment, this hypothesis consists of a set of sub-hypotheses     about how many copies of this chromosome segment were contributed by     each related individual to the target individual.

Technical Description of the System A Allele Calling: Best Method

Assume here the goal is to estimate the genetic data of an embryo as accurately as possible, and where the estimate is derived from measurements taken from the embryo, father, and mother across the same set of n SNPs. Note that where this description refers to SNPs, it may also refer to a locus where any genetic variation, such as a point mutation, insertion or deletion may be present. This allele calling method is part of the Parental Support (PS) system. One way to increase the fidelity of allele calls in the genetic data of a target individual for the purposes of making clinically actionable predictions is described here. It should be obvious to one skilled in the art how to modify the method for use in contexts where the target individual is not an embryo, where genetic data from only one parent is available, where neither, one or both of the parental haplotypes are known, or where genetic data from other related individuals is known and can be incorporated.

For the purposes of this discussion, only consider SNPs that admit two allele values; without loss of generality it is possible to assume that the allele values on all SNPs belong to the alphabet A={A,C}. It is also assumed that the errors on the measurements of each of the SNPs are independent. This assumption is reasonable when the SNPs being measured are from sufficiently distant genic regions. Note that one could incorporate information about haplotype blocks or other techniques to model correlation between measurement errors on SNPs without changing the fundamental concepts of this invention.

Let e=(e₁, e₂) be the true, unknown, ordered SNP information on the embryo, e₁, e₂εA^(n). Define e₁ to be the genetic haploid information inherited from the father and e₂ to be the genetic haploid information inherited from the mother. Also use e_(i)=(e_(1i),e_(2i)) to denote the ordered pair of alleles at the i-th position of e. In similar fashion, let f=(f₁,f₂) and m=(m₁,m₂) be the true, unknown, ordered SNP information on the father and mother respectively. In addition, let g₁ be the true, unknown, haploid information on a single sperm from the father. (One can think of the letter g as standing for gamete. There is no g₂. The subscript is used to remind the reader that the information is haploid, in the same way that f₁ and f₂ are haploid.) It is also convenient to define r=(f, m), so that there is a symbol to represent the complete set of diploid parent information from which e inherits, and also write r_(i)=(f_(i),m_(i))=((f_(1i),f_(2i)),(m_(1i),m_(2i))) to denote the complete set of ordered information on father and mother at the i-th SNP. Finally, let ê=(ê₁, ê₂) be the estimate of e that is sought, ê₁, ê₂εA^(n).

By a crossover map, it is meant an n-tuple θε{1,2}^(n) that specifies how a haploid pair such as (f₁,f₂) recombines to form a gamete such as e₁. Treating θ as a function whose output is a haploid sequence, define θ(f)_(i)=θ(f₁,f₂)_(i)=f_(θ) _(i) _(,i). To make this idea more concrete, let f₁=ACAAACCC, let f₂=CAACCACA, and let θ=11111222. Then θ(f₁,f₂)=ACAAAACA. In this example, the crossover map θ implicitly indicates that a crossover occurred between SNPs i=5 and i=6.

Formally, let θ be the true, unknown crossover map that determines e₁ from f, let φ be the true, unknown crossover map that determines e₂ from m, and let ψ be the true, unknown crossover map that determines g₁ from f. That is, e₁=θ(f), e₂=φ(m), g₁=ψ(f). It is also convenient to define X=(θ,φ,ψ) so that there is a symbol to represent the complete set of crossover information associated with the problem. For simplicity sake, write e=X(r) as shorthand for e=(θ(f), φ(m)); also write e_(i)=X(r_(i)) as shorthand for e_(i)=X(r)_(i)

In reality, when chromosomes combine, at most a few crossovers occur, making most of the 2^(n) theoretically possible crossover maps distinctly improbable. In practice, these very low probability crossover maps will be treated as though they had probability zero, considering only crossover maps belonging to a comparatively small set Ω. For example, if Ω is defined to be the set of crossover maps that derive from at most one crossover, then |Ω|=2n.

It is convenient to have an alphabet that can be used to describe unordered diploid measurements. To that end, let B={A,B,C, X}. Here A and C represent their respective homozygous locus states and B represents a heterozygous but unordered locus state. Note: this section is the only section of the document that uses the symbol B to stand for a heterozygous but unordered locus state. Most other sections of the document use the symbols A and B to stand for the two different allele values that can occur at a locus. X represents an unmeasured locus, i.e., a locus drop-out. To make this idea more concrete, let f₁=ACAAACCC, and let f₂=CAACCACA. Then a noiseless unordered diploid measurement of f would yield {tilde over (f)}=BBABBBCB.

In the problem at hand, it is only possible to take unordered diploid measurements of e, f, and m, although there may be ordered haploid measurements on g₁. This results in noisy measured sequences that are denoted {tilde over (e)}εB^(n), {tilde over (f)}εB^(n), {tilde over (m)}εB^(n), and {tilde over (g)}₁εA^(n) respectively. It will be convenient to define {tilde over (r)}=({tilde over (f)}, {tilde over (m)}) so that there is a symbol that represents the noisy measurements on the parent data. It will also be convenient to define {tilde over (D)}=({tilde over (r)}, {tilde over (e)}, {tilde over (g)}_(i)) so that there is a symbol to represent the complete set of noisy measurements associated with the problem, and to write {tilde over (D)}_(i)=({tilde over (r)}_(i), {tilde over (e)}_(i), {tilde over (g)}_(1i))=({tilde over (f)}_(i), {tilde over (m)}_(i), {tilde over (e)}_(i), {tilde over (g)}_(1i)) to denote the complete set of measurements on the i-th SNP. (Please note that, while f_(i) is an ordered pair such as (A,C), {tilde over (f)}_(i) is a single letter such as B.)

Because the diploid measurements are unordered, nothing in the data can distinguish the state (f₁,f₂) from (f₂,f₁) or the state (m₁,m₂) from (m₂,m₁). These indistinguishable symmetric states give rise to multiple optimal solutions of the estimation problem. To eliminate the symmetries, and without loss of generality, assign θ₁=φ₁=1.

In summary, then, the problem is defined by a true but unknown underlying set of information {r,e,g₁,X}, with e=X(r). Only noisy measurements {tilde over (D)}=({tilde over (r)}, {tilde over (e)}, {tilde over (g)}₁) are available. The goal is to come up with an estimate ê of e, based on {tilde over (D)}.

Note that this method implicitly assumes euploidy on the embryo. It should be obvious to one skilled in the art how this method could be used in conjunction with the aneuploidy calling methods described elsewhere in this patent. For example, the aneuploidy calling method could be first employed to ensure that the embryo is indeed euploid and only then would the allele calling method be employed, or the aneuploidy calling method could be used to determine how many chromosome copies were derived from each parent and only then would the allele calling method be employed. It should also be obvious to one skilled in the art how this method could be modified in the case of a sex chromosome where there is only one copy of a chromosome present.

Solution Via Maximum a Posteriori Estimation

In one embodiment of the invention, it is possible, for each of the n SNP positions, to use a maximum a posteriori (MAP) estimation to determine the most probable ordered allele pair at that position. The derivation that follows uses a common shorthand notation for probability expressions. For example, P(e′_(i), {tilde over (D)}|X′) is written to denote the probability that random variable e_(i) takes on value e′_(i) and the random variable {tilde over (D)} takes on its observed value, conditional on the event that the random variable X takes on the value X′. Using MAP estimation, then, the i-th component of ê, denoted ê_(i)=(ê_(1i),ê_(2i)) is given by

$\begin{matrix} {\hat{e}}_{i} & {= {\underset{e_{i}^{\prime}}{\arg \; \max}\; {P\left( {e_{i}^{\prime}\overset{\sim}{D}} \right)}}} \\ \; & {= {\underset{e_{i}^{\prime}}{\arg \; \max}\; {P\left( {e_{i}^{\prime},\overset{\sim}{D}} \right)}}} \\ \; & {= {\underset{e_{i}^{\prime}}{\arg \; \max}{\sum\limits_{X^{\prime} \in \; \Omega^{3}}\; {{P\left( X^{\prime} \right)}{P\left( {e_{i}^{\prime},{\overset{\sim}{D}X^{\prime}}} \right)}}}}} \\ (a) & {= {\underset{e_{i}^{\prime}}{\arg \; \max}\; {\sum\limits_{{X^{\prime} \in \; {\Omega^{3}:\theta_{1}^{\prime}}} = {\varphi_{1}^{\prime} = 1}}\; {{P\left( X^{\prime} \right)}{P\left( {e_{i}^{\prime},{{\overset{\sim}{D}}_{i}X^{\prime}}} \right)}{\prod\limits_{j \neq i}\; {P\left( {{\overset{\sim}{D}}_{j}X^{\prime}} \right)}}}}}} \\ (b) & {= {\underset{e_{i}^{\prime}}{\arg \; \max}{\sum\limits_{{X^{\prime} \in {\Omega^{3}:\theta_{1}^{\prime}}} = {\varphi_{1}^{\prime} = 1}}\; {{P\left( X^{\prime} \right)}{\sum\limits_{r_{i}^{\prime} \in A^{4}}\; {{P\left( r_{i}^{\prime} \right)}{P\left( {e_{i}^{\prime},{{\overset{\sim}{D}}_{i}X^{\prime}},r_{i}^{\prime}} \right)}{\prod\limits_{j \neq i}\; {\sum\limits_{r_{j}^{\prime} \in A^{4}}\; {{P\left( r_{j}^{\prime} \right)}{P\left( {{{\overset{\sim}{D}}_{j}X^{\prime}},r_{j}^{\prime}} \right)}}}}}}}}}} \\ (c) & {= {\underset{e_{i}^{\prime}}{\arg \; \max}{\sum\limits_{{X^{\prime} \in {\Omega^{3}:\theta_{1}^{\prime}}} = {\varphi_{1}^{\prime} = 1}}\; {{P\left( X^{\prime} \right)}{\sum\limits_{r_{i}^{\prime} \in A^{4}}\; {{P\left( r_{i}^{\prime} \right)}{P\left( {{e_{i}^{\prime}X^{\prime}},r_{i}^{\prime}} \right)}{P\left( {{{\overset{\sim}{D}}_{i}X^{\prime}},r_{i}^{\prime}} \right)}{\prod\limits_{j \neq i}\; {\sum\limits_{r_{j}^{\prime} \in A^{4}}\; {{P\left( r_{j}^{\prime} \right)}{P\left( {{{\overset{\sim}{D}}_{j}X^{\prime}},r_{j}^{\prime}} \right)}}}}}}}}}} \\ \left. {(*} \right) & {= {\underset{e_{i}^{\prime}}{\arg \; \max}{\sum\limits_{{X^{\prime} \in {\Omega^{3}:\theta_{1}^{\prime}}} = {\varphi_{1}^{\prime} = 1}}\; {{P\left( X^{\prime} \right)}{\prod\limits_{j}\; {\sum\limits_{r_{j}^{\prime} \in A^{4}}\; {1\left( {{i \neq {j\mspace{14mu} {or}\mspace{14mu} {X^{\prime}\left( r_{j}^{\prime} \right)}}} = e_{i}^{\prime}} \right){P\left( r_{j}^{\prime} \right)}{P\left( {{{\overset{\sim}{D}}_{j}X^{\prime}},r_{j}^{\prime}} \right)}}}}}}}} \end{matrix}$

In the preceding set of equations, (a) holds because the assumption of SNP independence means that all of the random variables associated with SNP i are conditionally independent of all of the random variables associated with SNP j, given X; (b) holds because r is independent of X; (c) holds because e_(i) and {tilde over (D)}_(i) are conditionally independent given r_(i) and X (in particular, e_(i)=X(r_(i))); and (*) holds, again, because e_(i)=X(r_(i)), which means that P(e′_(i)|X′,r′_(i)) evaluates to either one or zero and hence effectively filters r′_(i) to just those values that are consistent with e′_(i) and X′.

The final expression (*) above contains three probability expressions: P(X′), P(r′_(j)), and P({tilde over (D)}_(j)|X′,r′_(j)). The computation of each of these quantities is discussed in the following three sections.

Crossover Map Probabilities

Recent research has enabled the modeling of the probability of recombination between any two SNP loci. Observations from sperm studies and patterns of genetic variation show that recombination rates vary extensively on kilobase scales and that much recombination occurs in recombination hotspots. The NCBI data about recombination rates on the Human Genome is publicly available through the UCSC Genome Annotation Database.

One may use the data set from the Hapmap Project or the Perlegen Human Haplotype Project. The latter is higher density; the former is higher quality. These rates can be estimated using various techniques known to those skilled in the art, such as the reversible-jump Markov Chain Monte Carlo (MCMC) method that is available in the package LDHat.

In one embodiment of the invention, it is possible to calculate the probability of any crossover map given the probability of crossover between any two SNPs. For example, P(θ=11111222) is one half the probability that a crossover occurred between SNPs five and six. The reason it is only half the probability is that a particular crossover pattern has two crossover maps associated with it: one for each gamete. In this case, the other crossover map is θ=22222111.

Recall that X=(θ,φ,ψ), where e₁=θ(f), e₂=φ(m), g₁=ψ(f). Obviously θ, φ, and ψ result from independent physical events, so P(X)=P(θ)P(φ)P(ψ). Further assume that P_(θ)(•)=P_(θ)(•)=P_(ψ)(•), where the actual distribution P_(θ)(•) is determined in the obvious way from the Hapmap data.

Allele Probabilities

It is possible to determine P(r_(i))=P(f_(i))P(m_(i))=P(f_(i1))P(f_(i2))P(m_(i1))P(m_(i2)) using population frequency information from databases such as dbSNP. Also, as mentioned previously, choose SNPs for which the assumption of intra-haploid independence is a reasonable one. That is, assume that

${P(r)} = {\prod\limits_{i}\; {P\left( r_{i} \right)}}$

Measurement Errors

Conditional on whether a locus is heterozygous or homozygous, measurement errors may be modeled as independent and identically distributed across all similarly typed loci. Thus:

$\begin{matrix} {{P\left( {{\overset{\sim}{D}X},r} \right)} = {\prod\limits_{i}\; {P\left( {{{\overset{\sim}{D}}_{i}X},r_{i}} \right)}}} \\ {= {\prod\limits_{i}\; {P\left( {{\overset{\sim}{f}}_{i},{\overset{\sim}{m}}_{i},{\overset{\sim}{e}}_{i},{{\overset{\sim}{g}}_{1i}X},f_{i},m_{i}} \right)}}} \\ {= {\prod\limits_{i}\; {{P\left( {{\overset{\sim}{f}}_{i}f_{i}} \right)}{P\left( {{\overset{\sim}{m}}_{i}m_{i}} \right)}{P\left( {{{\overset{\sim}{e}}_{i}{\theta \left( f_{i} \right)}},{\varphi \left( m_{i} \right)}} \right)}{P\left( {{\overset{\sim}{g}}_{1i}{\psi \left( f_{i} \right)}} \right)}}}} \end{matrix}$

where each of the four conditional probability distributions in the final expression is determined empirically, and where the additional assumption is made that the first two distributions are identical. For example, for unordered diploid measurements on a blastomere, empirical values p_(d)=0.5 and p_(a)=0.02 are obtained, which lead to the conditional probability distribution for P({tilde over (e)}_(i)|e_(i)) shown in Table 1.

Note that the conditional probability distributions mentioned above, P({tilde over (f)}_(i)|f_(i)), P({tilde over (m)}_(i)|m_(i)), P({tilde over (e)}_(i)|e_(i)), can vary widely from experiment to experiment, depending on various factors in the lab such as variations in the quality of genetic samples, or variations in the efficiency of whole genome amplification, or small variations in protocols used. Therefore, in a preferred embodiment, these conditional probability distributions are estimated on a per-experiment basis. We focus in later sections of this disclosure on estimating P({tilde over (e)}_(i)|e_(i)), but it will be clear to one skilled in the art after reading this disclosure how similar techniques can be applied to estimating P({tilde over (f)}_(i)|f_(i)) and P({tilde over (m)}_(i)|m_(i)). The distributions can each be modeled as belonging to a parametric family of distributions whose particular parameter values vary from experiment to experiment. As one example among many, it is possible to implicitly model the conditional probability distribution P({tilde over (e)}_(i)|e_(i)) as being parameterized by an allele dropout parameter p_(d) and an allele dropin parameter p_(a). The values of these parameters might vary widely from experiment to experiment, and it is possible to use standard techniques such as maximum likelihood estimation, MAP estimation, or Bayesian inference, whose application is illustrated at various places in this document, to estimate the values that these parameters take on in any individual experiment. Regardless of the precise method one uses, the key is to find the set of parameter values that maximizes the joint probability of the parameters and the data, by considering all possible tuples of parameter values within a region of interest in the parameter space. As described elsewhere in the document, this approach can be implemented when one knows the chromosome copy number of the target genome, or when one doesn't know the copy number call but is exploring different hypotheses. In the latter case, one searches for the combination of parameters and hypotheses that best match the data are found, as is described elsewhere in this disclosure.

Note that one can also determine the conditional probability distributions as a function of particular parameters derived from the measurements, such as the magnitude of quantitative genotyping measurements, in order to increase accuracy of the method. This would not change the fundamental concept of the invention.

It is also possible to use non-parameteric methods to estimate the above conditional probability distributions on a per-experiment basis. Nearest neighbor methods, smoothing kernels, and similar non-parameteric methods familiar to those skilled in the art are some possibilities. Although this disclosure focuses parametric estimation methods, use of non-parameteric methods to estimate these conditional probability distributions would not change the fundamental concept of the invention. The usual caveats apply: parametric methods may suffer from model bias, but have lower variance. Non-parametric methods tend to be unbiased, but will have higher variance.

Note that it should be obvious to one skilled in the art, after reading this disclosure, how one could use quantitative information instead of explicit allele calls, in order to apply the PS method to making reliable allele calls, and this would not change the essential concepts of the disclosure.

B Factoring the Allele Calling Equation

In a preferred embodiment of the invention, the algorithm for allele calling can be structured so that it can be executed in a more computationally efficient fashion. In this section the equations are re-derived for allele-calling via the MAP method, this time reformulating the equations so that they reflect such a computationally efficient method of calculating the result.

Notation

X*,Y*,Z*ε{A,C}^(n×2) are the true ordered values on the mother, father, and embryo respectively.

H*ε{A,C}^(n×h) are true values on sperm samples.

B*ε{A,C}^(n×b×2) are true ordered values on b blastomeres.

D={x,y,z,B,H} is the set of unordered measurement data on father, mother, embryo, blastomeres and h sperm samples. D_(i)={x_(i),y_(i),z_(i),H_(i),B_(i)} is the data set restricted to the i-th SNP.

rε{A,C}⁴ represents a candidate 4-tuple of ordered values on both the mother and father at a particular locus.

{circumflex over (Z)}_(i)ε{A,C}² is the estimated ordered embryo value at SNP L

Q=(2+2b+h) is the effective number of haploid chromosomes being measured, excluding the parents. Any hypothesis about the parental origin of all measured data (excluding the parents themselves) requires that Q crossover maps be specified.

χε{1,2}^(n×Q) is a crossover map matrix, representing a hypothesis about the parental origin of all measured data, excluding the parents. Note that there are 2^(nQ) different crossover matrices. χ_(i)

χ_(i), is the matrix restricted to the i-th row. Note that there are 2^(Q) vector values that the i-th row can take on, from the set χε{1,2}^(Q).

f(x,y,z) is a function of (x,y,z) that is being treated as a function of just x. The values behind the semi-colon are constants in the context in which the function is being evaluated.

PS Equation Factorization

$\begin{matrix} {\mspace{79mu} {{{\overset{.}{Z}}_{i} = {{\underset{Z_{i}}{\arg \; \max}{P\left( {Z_{i},D} \right)}}\mspace{79mu} = {{\underset{Z_{i}}{\arg \; \max}\text{?}{P(\chi)}{P\left( {\text{?},{D\chi}} \right)}} = {{\text{?}\text{?}{P\left( \text{?} \right)}{P\left( {\text{?}\text{?}} \right)}\mspace{14mu} \ldots \mspace{14mu} {P\left( {\text{?}\text{?}} \right)}\left( {\text{?}{P\left( \text{?} \right)}{P\left( {{\text{?}\text{?}}{\text{?}\text{?}}} \right)}} \right)\text{?}\left( {\text{?}{P\left( \text{?} \right)}{P\left( {\text{?}{\text{?}\text{?}}} \right)}} \right)} = {{\text{?}\text{?}{P\left( \chi_{1} \right)}{P\left( {\chi_{2}\chi_{1}} \right)}\mspace{14mu} \ldots \mspace{14mu} {P\left( {\chi_{n}\chi_{n - 1}} \right)}{f_{1}\left( {\text{?}\text{?}\text{?}} \right)}\text{?}\text{?}\left( {\chi_{j},D_{j}} \right)} = {{\text{?}\text{?}\mspace{14mu} \ldots \mspace{14mu} \text{?}{P\left( \chi_{1} \right)}{P\left( {\chi_{2}\chi_{1}} \right)}\mspace{14mu} \ldots \mspace{14mu} {P\left( {\text{?}\chi_{n - 1}} \right)}{f_{1}\left( {\text{?},\text{?},\text{?}} \right)}\text{?}{f_{2}\left( {\text{?},\text{?}} \right)}}\mspace{79mu} = {\text{?}\text{?}{P\left( \chi_{1} \right)}{f_{2}\left( {\chi_{1},D_{1}} \right)} \times \text{?}{P\left( {\text{?}\text{?}} \right)}{f_{2}\left( {\text{?},\text{?}} \right)}}}}}}}}\mspace{79mu} {\chi \mspace{14mu} \ldots \mspace{14mu} \text{?}{P\left( {\text{?}\text{?}} \right)}{f_{1}\left( {\text{?},\text{?},\text{?}} \right)}}\mspace{79mu} {\chi \mspace{14mu} \ldots \mspace{14mu} \text{?}{P\left( {\text{?}\text{?}} \right)}{f_{2}\left( {\text{?},\text{?}} \right)}}{\text{?}\text{indicates text missing or illegible when filed}}}} & \; \end{matrix}$

The number of different crossover matrices χ is 2^(nQ). Thus, a brute-force application of the first line above is O(n2^(nQ)). By exploiting structure via the factorization of P(χ) and P(z_(i),D|χ), and invoking the previous result, final line gives an expression that can be computed in O(n2^(2Q)).

C Quantitative Detection of Aneuploidy

In one embodiment of the invention, aneuploidy can be detected using the quantitative data output from the PS method discussed in this patent. Disclosed herein are multiple methods that make use of the same concept; these methods are termed Copy Number Calling (CNC). The statement of the problem is to determine the copy number of each of 23 chromosome-types in a single cell. The cell is first pre-amplified using a technique such as whole genome amplification using the MDA method. Then the resulting genetic material is selectively amplified with a technique such as PCR at a set of n chosen SNPs at each of m=23 chromosome types.

This yields a data set {t_(ij)}, i=1 . . . n, j=1 . . . m of regularized ct (ct, or CT, is the point during the cycle time of the amplification at which dye measurement exceeds a given threshold) values obtained at SNP i, chromosome j. A regularized ct value implies that, for a given (i,j), the pair of raw ct values on channels FAM and VIC (these are arbitrary channel names denoting different dyes) obtained at that locus are combined to yield a ct value that accurately reflects the ct value that would have been obtained had the locus been homozygous. Thus, rather than having two ct values per locus, there is just one regularized ct value per locus.

The goal is to determine the set {n_(j)} of copy numbers on each chromosome. If the cell is euploid, then n_(j)=2 for all j; one exception is the case of the male X chromosome. If n_(j)≠2 for at least one j, then the cell is aneuploid; excepting the case of male X.

Biochemical Model

The relationship between ct values and chromosomal copy number is modeled as follows: α_(ij)n_(j)Q2^(β) ^(ij) ^(t) ^(ij) =QT In this expression, n_(j) is the copy number of chromosome j. Q is an abstract quantity representing a baseline amount of pre-amplified genetic material from which the actual amount of pre-amplified genetic material at SNP i, chromosome j can be calculated as α_(ij)n_(j)Q. α_(ij) is a preferential amplification factor that specifies how much more SNP i on chromosome j will be pre-amplified via MDA than SNP 1 on chromosome 1. By definition, the preferential amplification factors are relative to α₁₁

1.

β_(ij) is the doubling rate for SNP i chromosome j under PCR. t_(ij) is the ct value. Q_(T) is the amount of genetic material at which the ct value is determined. T is a symbol, not an index, and merely stands for threshold.

It is important to realize that α_(ij), β_(ij), and Q_(T) are constants of the model that do not change from experiment to experiment. By contrast, n_(j) and Q are variables that change from experiment to experiment. Q is the amount of material there would be at SNP 1 of chromosome 1, if chromosome 1 were monosomic.

The original equation above does not contain a noise term. This can be included by rewriting it as follows:

${(*}{{)\beta_{ij}t_{ij}} = {{\log \; \frac{Q_{T}}{\alpha_{ij}}} - {\log \; n_{j}} - \; {\log \; Q} + \; Z_{ij}}}$

The above equation indicates that the ct value is corrupted by additive Gaussian noise Z_(ij). Let the variance of this noise term be σ_(ij) ².

Maximum Likelihood (ML) Estimation of Copy Number

In one embodiment of the method, the maximum likelihood estimation is used, with respect to the model described above, to determine n_(j). The parameter Q makes this difficult unless another constraint is added:

${\frac{1}{m}{\sum\limits_{j}\; {\log \mspace{11mu} n_{j}}}} = 1$

This indicates that the average copy number is 2, or, equivalently, that the average log copy number is 1. With this additional constraint one can now solve the following ML problem:

$\hat{Q},{{\hat{n}}_{j} = {\arg \; \max \; {\prod\limits_{ij}\; {f_{z}\left( {{\log \; n_{j}} + {\log \; Q} - \left( {{\log \; \frac{Q_{T}}{\alpha_{ij}}} - {\beta_{ij}t_{ij}}} \right)} \right)}}}}$ ${{s.t.\frac{1}{m}}{\sum\limits_{j}\; {\log \; n_{j}}}} = {1 = {\underset{Q,n_{j}}{\arg \; \min}\; {\sum\limits_{ij}\; {\frac{1}{\sigma_{ij}^{2}}\left( {{\log \mspace{11mu} n_{j}} + {\log \; Q} - \left( {{\log \; \frac{Q_{T}}{\alpha_{ij}}} - {\beta_{ij}t_{ij}}} \right)} \right)^{2}}}}}$ ${{s.t.\; \frac{1}{m}}{\sum\limits_{j}\; {\log \mspace{11mu} n_{j}}}} = 1$

The last line above is linear in the variables log n_(j), and log Q, and is a simple weighted least squares problem with an equality constraint. The solution can be obtained in closed form by forming the Lagrangian

${L\left( {{\log \mspace{11mu} n_{j}},{\log \mspace{11mu} Q}} \right)} = {{\sum\limits_{ij}\; {\frac{1}{\sigma_{ij}^{2}}\left( {{\log \mspace{11mu} n_{j}} + {\log \mspace{11mu} Q} - \left( {{\log \; \frac{O_{T}}{\alpha_{ij}}} - {\beta_{ij}t_{ij}}} \right)} \right)^{2}}} + {\lambda {\sum\limits_{j}\; {\log \mspace{11mu} n_{j}}}}}$

and taking partial derivatives. Solution when Noise Variance is Constant

To avoid unnecessarily complicating the exposition, set σ_(ij) ²=1. This assumption will remain unless explicitly stated otherwise. (In the general case in which each σ_(ij) ² is different, the solutions will be weighted averages instead of simple averages, or weighted least squares solutions instead of simple least squares solutions.) In that case, the above linear system has the solution:

${\log \mspace{14mu} Q_{j}}\overset{\Delta}{=}{\frac{1}{n}{\sum\limits_{i}\; \left( {{\log \; \frac{Q_{T}}{\alpha_{ij}}} - {\beta_{ij}t_{ij}}} \right)}}$ ${\log \mspace{11mu} Q} = {{\frac{1}{m}{\sum\limits_{j}\; {\log \mspace{11mu} Q_{j}}}} - 1}$ ${\log \mspace{11mu} n_{j}} = {{{\log \mspace{11mu} Q_{j}} - {\log \mspace{11mu} Q}} = {\log \; \frac{Q_{j}}{Q}}}$

The first equation can be interpreted as a log estimate of the quantity of chromosome j. The second equation can be interpreted as saying that the average of the Q_(j) is the average of a diploid quantity; subtracting one from its log gives the desired monosome quantity. The third equation can be interpreted as saying that the copy number is just the ratio

$\frac{Q_{j}}{Q}.$

Note that n_(j) is a ‘double difference’, since it is a difference of Q-values, each of which is itself a difference of values.

Simple Solution

The above equations also reveal the solution under simpler modeling assumptions: for example, when making the assumption α_(ij)=1 for all i and j and/or when making the assumption that β_(ij)=β for all i and j. In the simplest case, when both α_(ij)=1 and β_(ij)=β, the solution reduces to

${{(*}{*)}}{{\log \mspace{11mu} n_{j}} = {1 + {\beta\left( {{\frac{1}{mn}{\sum\limits_{ij}\; t_{ij}}} - {\frac{1}{n}{\sum\limits_{i}\; t_{ij}}}} \right)}}}$

The Double Differencing Method

In one embodiment of the invention, it is possible to detect monosomy using double differencing. It should be obvious to one skilled in the art how to modify this method for detecting other aneuploidy states. Let {t_(ij)} be the regularized ct values obtained from MDA pre-amplification followed by PCR on the genetic sample. As always, t_(ij) is the ct value on the i-th SNP of the j-th chromosome. Denote by t_(j) vector of ct values associated with the j-th chromosome. Make the following definitions:

$\overset{\_}{t}\overset{\Delta}{=}{\frac{1}{mn}{\sum\limits_{i,j}\; t_{ij}}}$ ${\overset{\sim}{t}}_{j}\overset{\Delta}{=}{t_{j} - {\overset{\_}{t}\; 1}}$

Classify chromosome j as monosomic if and only if f^(T){tilde over (t)}_(j) is higher than a certain threshold value, where f is a vector that represents a monosomy signature. f is the matched filter, whose construction is described next.

The matched filter f is constructed as a double difference of values obtained from two controlled experiments. Begin with known quantities of euploid male genetic data and euploid female genetic material. Assume there are large quantities of this material, and pre-amplification can be omitted. On both the male and female material, use PCR to sequence n SNPs on both the X chromosome (chromosome 23), and chromosome 7. Let {t_(ij) ^(X)}, i=1 . . . n, jε{7, 23} denote the measurements on the female, and let {t_(ij) ^(Y)} similarly denote the measurements on the male. Given this, it is possible to construct the matched filter f from the resulting data as follows:

${\overset{\_}{t}}_{7}^{X}\overset{\Delta}{=}{\frac{1}{n}{\sum\limits_{i}^{\;}\; t_{i,7}^{X}}}$ ${\overset{\_}{t}}_{7}^{Y}\overset{\Delta}{=}{\frac{1}{n}{\sum\limits_{i}^{\;}\; t_{i,7}^{Y}}}$ $\Delta^{X}\overset{\Delta}{=}{t_{23}^{X} - {{\overset{\_}{t}}_{7}^{X}1}}$ $\Delta^{Y}\overset{\Delta}{=}{t_{23}^{Y} - {{\overset{\_}{t}}_{7}^{Y}1}}$ $f\overset{\Delta}{=}{\Delta^{Y} - \Delta^{X}}$

In the above, equations, t ₇ ^(X) and t ₇ ^(Y) are scalars, while Δ^(X) and Δ^(Y) are vectors. Note that the superscripts X and Y are just symbolic labels, not indices, denoting female and male respectively. Do not to confuse the superscript X with measurements on the X chromosome. The X chromosome measurements are the ones with subscript 23.

The next step is to take noise into account and to see what remnants of noise survive in the construction of the matched filter f as well as in the construction of {tilde over (t)}_(j). In this section, consider the simplest possible modeling assumption: that β_(ij)=β for all i and j, and that α_(ij)=1 for all i and j. Under these assumptions, from (*) above:

βt _(ij)=log Q _(T)−log n _(j)−log Q+Z _(ij)

Which can be rewritten as:

$t_{ij} = {{\frac{1}{\beta}\log \; Q_{T}} - {\frac{1}{\beta}\log \; n_{j}} - {\frac{1}{\beta}\log \; Q} + Z_{ij}}$

In that case, the i-th component of the matched filter f is given by:

$f_{i}\overset{\Delta}{=}{{\Delta_{i}^{Y} - \Delta_{i}^{X}} = {{\left\{ {t_{i,23}^{Y} - {\overset{\_}{t}}_{7}^{Y}} \right\} - {\text{\{}\text{(}t_{i,23}^{X}} - {{\overset{\_}{t}}_{7}^{X}\text{\}}}} = {{\left\{ {\left( {{\frac{1}{\beta}\log \; Q_{T}} - {\frac{1}{\beta_{i,23}}\log \; n_{23}^{Y}} - {\frac{1}{\beta}\log \; Q^{Y}} + Z_{i,23}^{Y}} \right) - {\frac{1}{n}{\sum\limits_{i}^{\;}\; \left( {{\frac{1}{\beta}\log \; Q_{T}} - {\frac{1}{\beta}\log \; n_{7}^{Y}} - {\frac{1}{\beta}\log \; Q^{Y}} + Z_{i,7}^{Y}} \right)}}} \right\} - \left\{ {\left( {{\frac{1}{\beta}\log \; Q_{T}} - {\frac{1}{\beta}\log \; n_{23}^{X}} - {1\frac{1}{\beta}\log \; Q^{X}} + Z_{i,23}^{X}} \right) - {\frac{1}{n}{\sum\limits_{i}^{\;}\; \left( {{\frac{1}{\beta}\log \; Q_{T}} - {\frac{1}{\beta}\log \; n_{7}^{X}} - {\frac{1}{\beta}\log \; Q^{X}} + Z_{i,7}^{X}} \right)}}} \right\}} = {\left\{ {\frac{1}{\beta} + Z_{i,23}^{Y} - {\frac{1}{n}{\sum\limits_{i}^{\;}\; Z_{i,7}^{Y}}}} \right\} - \left\{ {Z_{i,23}^{X} - {\frac{1}{n}{\sum\limits_{i}^{\;}\; Z_{i,7}^{X}}}} \right\}}}}}$

Note that the above equations take advantage of the fact that all the copy number variables are known, for example, n₂₃ ^(Y)=1 and that n₂₃ ^(X)=2.

Given that all the noise terms are zero mean, the ideal matched filter is

$\frac{1}{\beta}1.$

Further, since scaling the filter vector doesn't really change things, the vector 1 can be used as the matched filter. This is equivalent to simply taking the average of the components of {tilde over (t)}_(j). In other words, the matched filter paradigm is not necessary if the underlying biochemistry follows the simple model. In addition, one may omit the noise terms above, which can only serve to lower the accuracy of the method. Accordingly, this gives:

${\overset{\sim}{t}}_{ij}\overset{\Delta}{=}{{t_{j} - \overset{\_}{t}} = {{\left\{ {{\frac{1}{\beta}\log \; Q_{T}} - {\frac{1}{\beta}\log \; n_{j}} - {\frac{1}{\beta}\log \; Q} + Z_{ij}} \right\} - {\frac{1}{m\; n}{\sum\limits_{i,j}\left\{ {{\frac{1}{\beta}\log \; Q_{T}} - {\frac{1}{\beta}\log \; n_{j}} - {\frac{1}{\beta}\log \; Q} + Z_{ij}} \right\}}}} = {{\frac{1}{\beta}\left( {1 - {\log \; n_{j}}} \right)} + Z_{ij} - {\frac{1}{m\; n}{\sum\limits_{i,j}Z_{ij}}}}}}$

In the above, it is assumed that

${\frac{1}{m\; n}{\sum\limits_{i,j}^{\;}\; {\log \; n_{j}}}} = 1.$

that is, that me average copy number is 2. Each element of the vector is an independent measurement of the log copy number (scaled by 1/β) and then corrupted by noise. The noise term Z_(ij) cannot be gotten rid of: it is inherent in the measurement. The second noise term probably cannot be gotten rid of either, since subtracting out t is necessary to remove the nuisance term

$\frac{1}{\beta}\log \; {Q.}$

Again, note that, given the observation that each element of t_(j) an independent measurement of

${\frac{1}{\beta}\left( {1 - {\log \; n_{j}}} \right)},$

it is clear mat a UMVU (uniform minimum variance unbiased) estimate of

$\frac{1}{\beta}\left( {1 - {\log \; n_{j}}} \right)$

the elements of {tilde over (t)}_(j). (In the case in which each σ_(ij) ² is different, it will be a weighted average.) Thus, performing a little bit of algebra, the UMVU estimator for log n_(j) is given by:

$\left. {{\frac{1}{n}{\sum\limits_{i}^{\;}\; {\overset{\sim}{t}}_{ij}}} \approx {\frac{1}{\beta}\left( {1 - {\log \; n_{j}}} \right)}}\Rightarrow{{\log \; n_{j}} \approx {1 - {{\beta \cdot \frac{1}{n}}{\sum\limits_{ij}^{\;}\; t_{ij}}}}} \right. = {1 - {\beta \left( {{\frac{1}{n}{\sum\limits_{i}^{\;}\; t_{ij}}} - {\frac{1}{m\; n}{\sum\limits_{i,j}^{\;}\; t_{ij}}}} \right)}}$

Analysis Under the Complicated Model

Now repeat the preceding analysis with respect to a biochemical model in which each β_(ij) and α_(ij) is different. Again, take noise into account and to see what remnants of noise survive in the construction of the matched filter f as well as in the construction of {tilde over (t)}_(j). Under the complicated model, from (*) above:

${\beta_{ij}t_{ij}} = {{\log \frac{Q_{T}}{\alpha_{ij}}} - {\log \; n_{j}} - {\log \; Q} + Z_{ij}}$

Which can be rewritten as:

${{(*}{**)}}{t_{ij} = {{\frac{1}{\beta_{ij}}\log \frac{Q^{T}}{\alpha_{ij}}} - {\frac{1}{\beta_{ij}}\log \; n_{j}} - {\frac{1}{\beta_{ij}}\log \; Q} + Z_{ij}}}$

The i-th component of the matched filter is given by:

$f_{i}\overset{\Delta}{=}{{\Delta_{i}^{Y} - \Delta_{i}^{X}} = {{\left\{ {t_{i,23}^{Y} - {\overset{\_}{t}}_{7}^{Y}} \right\} - {\text{\{}\left( {t_{i,23}^{X} - {\overset{\_}{t}}_{7}^{X}} \right\}}} = {{\left\{ {\left( {{\frac{1}{\beta_{i,23}}\log \frac{Q_{T}}{\alpha_{i,23}}} - {\frac{1}{\beta_{i,23}}\log \; n_{23}^{Y}} - {\frac{1}{\beta_{i,23}}\log \; Q^{Y}} + Z_{i,23}^{Y}} \right) - {\frac{1}{n}{\sum\limits_{i}^{\;}\; \left( {{\frac{1}{\beta_{i,7}}\log \frac{Q_{T}}{\alpha_{i,7}}} - {\frac{1}{\beta_{i,7}}\log \; n_{7}^{Y}} - {\frac{1}{\beta_{i,7}}\log \; Q^{Y}} + Z_{i,7}^{Y}} \right)}}} \right\} - \left\{ {\left( {{\frac{1}{\beta_{i,23}}\log \frac{Q_{T}}{\alpha_{i,23}}} - {\frac{1}{\beta_{i,23}}\log \; n_{23}^{X}} - {1\frac{1}{\beta_{i,23}}\log \; Q^{X}} + Z_{i,23}^{X}} \right) - {\frac{1}{n}{\sum\limits_{i}^{\;}\; \left( {{\frac{1}{\beta_{i,7}}\log \frac{Q_{T}}{\alpha_{i,7}}} - {\frac{1}{\beta_{i,7}}\log \; n_{7}^{X}} - {\frac{1}{\beta_{i,7}}\log \; Q^{X}} + Z_{i,7}^{X}} \right)}}} \right\}} = {\frac{1}{\beta_{i,23}} + {\left( {\frac{1}{\beta_{i,23}} - \left( {\frac{1}{n}{\sum\limits_{i}^{\;}\; \frac{1}{\beta_{i,7}}}} \right)} \right)\log \frac{Q^{Y}}{Q^{X}}} + \left\{ {Z_{i,23}^{Y} - Z_{i,23}^{X} + {\frac{1}{n}{\sum\limits_{i}^{\;}\; Z_{i,7}^{X}}} - {\frac{1}{n}{\sum\limits_{i}^{\;}\; Z_{i,7}^{X}}}} \right\}}}}}$

Under the complicated model, this gives:

${\overset{\sim}{t}}_{ij}\overset{\Delta}{=}{{t_{j} - \overset{\_}{t}} = {\left\{ {{\frac{1}{\beta_{ij}}\log \frac{Q_{T}}{\alpha_{ij}}} - {\frac{1}{\beta_{ij}}\log \; n_{j}} - {\frac{1}{\beta_{ij}}\log \; Q} + Z_{ij}} \right\} - {\frac{1}{m\; n}{\sum\limits_{ij}^{\;}\; \left\{ {{\frac{1}{\beta_{ij}}\log \frac{Q_{T}}{\alpha_{ij}}} - {\frac{1}{\beta_{ij}}\log \; n_{j}} - {\frac{1}{\beta_{ij}}\log \; Q}\; + Z_{ij}} \right\}}}}}$

An Alternate Way to Regularize CT Values

In another embodiment of the method, one can average the CT values rather than transforming to exponential scale and then taking logs, as this distorts the noise so that it is no longer zero mean. First, start with known Q and solve for betas. Then do multiple experiments with known n_j to solve for alphas. Since aneuploidy is a whole set of hypotheses, it is convenient to use ML to determine the most likely n_j and Q values, and then use this as a basis for calculating the most likely aneuploid state, e.g., by taking the n_j value that is most off from 1 and pushing it to its nearest aneuploid neighbor.

Estimation of the Error Rates in the Embryonic Measurements.

In one embodiment of the invention, it is possible to determine the conditional probabilities of particular embryonic measurements given specific underlying true states in embryonic DNA. In certain contexts, the given data consists of (i) the data about the parental SNP states, measured with a high degree of accuracy, and (ii) measurements on all of the SNPs in a specific blastomere, measured poorly.

Use the following notation: U—is any specific homozygote, U is the other homozygote at that SNP, H is the heterozygote. The goal is to determine the probabilities (p_(ij)) shown in Table 2. For instance p₁₁ is the probability of the embryonic DNA being U and the readout being U as well. There are three conditions that these probabilities have to satisfy:

p ₁₁ +p ₁₂ +p ₁₃ +p ₁₄=1  (1)

p ₂₁ +p ₂₂ +p ₂₃ +p ₂₄=1  (2)

p ₂₁ =p ₂₃  (3)

The first two are obvious, and the third is the statement of symmetry of heterozygote dropouts (H should give the same dropout rate on average to either U or Ū).

There are 4 possible types of matings: U×U, UxŪ, U×H, H×H. Split all of the SNPs into these 4 categories depending on the specific mating type. Table 3 shows the matings, expected embryonic states, and then probabilities of specific readings (p_(ij)). Note that the first two rows of this table are the same as the two rows of the Table 2 and the notation (p_(ij)) remains the same as in Table 2.

Probabilities p_(3i) and p_(4i) can be written out in terms of p_(1i) and p_(2i).

p ₃₁=½[p ₁₁ +p ₂₁]  (4)

p ₃₂=½[p ₁₂ +p ₂₂]  (5)

p ₃₃=½[p ₁₃ +p ₂₃]  (6)

p ₃₄=½[p ₁₄ +p ₂₄]  (7)

p ₄₁=¼[p ₁₁+2p ₂₁ +p ₁₃]  (8)

p ₄₂=½[p ₁₂ +p ₂₂]  (9)

p ₄₃=¼[p ₁₁+2p ₂₃ +p ₁₃]  (10)

p ₄₄=½[p ₁₄ +p ₂₄]  (11)

These can be thought of as a set of 8 linear constraints to add to the constraints (1), (2), and (3) listed above. If a vector P=[p₁₁, p₁₂, p₁₃, p₁₄, p₂₁, . . . , p₄₄]^(T) (16×1 dimension) is defined, then the matrix A (11×16) and a vector C can be defined such that the constraints can be represented as:

AP=C  (12)

C=[1,1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]^(T).

Specifically, A is shown in Table 4, where empty cells have zeroes.

The problem can now be framed as that of finding P that would maximize the likelihood of the observations and that is subject to a set of linear constraints (AP=C). The observations come in the same 16 types as p_(ij). These are shown in Table 5. The likelihood of making a set of these 16 n_(ij) observations is defined by a multinomial distribution with the probabilities p_(ij) and is proportional to:

$\begin{matrix} {{L\left( {P,n_{ij}} \right)} \propto {\prod\limits_{ij}^{\;}\; p_{ij}^{n_{ij}}}} & (13) \end{matrix}$

Note that the full likelihood function contains multinomial coefficients that are not written out given that these coefficients do not depend on P and thus do not change the values within P at which L is maximized. The problem is then to find:

$\begin{matrix} \begin{matrix} {{\max\limits_{P}\left\lbrack {L\left( {P,n_{ij}} \right)} \right\rbrack} = {\max\limits_{P}\left\lbrack {\ln \left( {L\left( {P,n_{ij}} \right)} \right)} \right\rbrack}} \\ {= {\max\limits_{P}\left( {\sum\limits_{ij}^{\;}\; {n_{ij}{\ln \left( p_{ij} \right)}}} \right)}} \end{matrix} & (14) \end{matrix}$

subject to the constraints AP=C. Note that in (14) taking the ln of L makes the problem more tractable (to deal with a sum instead of products). This is standard given that value of x such that f(x) is maximized is the same for which ln(f(x)) is maximized.

P(n _(j) ,Q,D)=P(n _(j))P(Q)P(D _(j) |Q,n _(j))P(D _(k≠j) |Q)

D MAP Detection of Aneuploidy without Parents

In one embodiment of the invention, the PS method can be applied to determine the number of copies of a given chromosome segment in a target without using parental genetic information. In this section, a maximum a-posteriori (MAP) method is described that enables the classification of genetic allele information as aneuploid or euploid. The method does not require parental data, though when parental data are available the classification power is enhanced. The method does not require regularization of channel values. One way to determine the number of copies of a chromosome segment in the genome of a target individual by incorporating the genetic data of the target individual and related individual(s) into a hypothesis, and calculating the most likely hypothesis is described here. In this description, the method will be applied to ct values from TAQMAN measurements; it should be obvious to one skilled in the art how to apply this method to any kind of measurement from any platform. The description will focus on the case in which there are measurements on just chromosomes X and 7; again, it should be obvious to one skilled in the art how to apply the method to any number of chromosomes and sections of chromosomes.

Setup of the Problem

The given measurements are from triploid blastomeres, on chromosomes X and 7, and the goal is to successfully make aneuploidy calls on these. The only “truth” known about these blastomeres is that there must be three copies of chromosome 7. The number of copies of chromosome X is not known.

The strategy here is to use MAP estimation to classify the copy number N₇ of chromosome 7 from among the choices {1,2,3} given the measurements D. Formally that looks like this:

${\hat{n}}_{7} = {\underset{n_{T} \in {({1,2,3})}}{\arg \; \max}{P\left( {n_{7},D} \right)}}$

Unfortunately, it is not possible to calculate this probability, because the probability depends on the unknown quantity Q. If the distribution f on Q were known, then it would be possible to solve the following:

${\hat{n}}_{7} = {\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{P\left( {n_{7},\left. D \middle| Q \right.} \right)}{Q}}}}$

In practice, a continuous distribution on Q is not known. However, identifying Q to within a power of two is sufficient, and in practice a probability mass function (pmf) on Q that is uniform on say {2¹, 2² . . . , 2⁴⁰} can be used. In the development that follows, the integral sign will be used as though a probability distribution function (pdf) on Q were known, even though in practice a uniform pmf on a handful of exponential values of Q will be substituted.

This discussion will use the following notation and definitions:

-   -   N₇ is the copy number of chromosome seven. It is a random         variable. n₇ denotes a potential value for N₇.     -   N_(X) is the copy number of chromosome X. n_(X) denotes a         potential value for N_(X).     -   N_(j) is the copy number of chromosome-j, where for the purposes         here jε{7,X}. n_(j) denotes a potential value for N_(j).     -   D is the set of all measurements. In one case, these are TAQMAN         measurements on chromosomes X and 7, so this gives D={D₇,D_(X)},         where D_(j)={t_(ij) ^(A),t_(ij) ^(C)} is the set of TAQMAN         measurements on this chromosome.     -   t_(ij) ^(A) is the ct value on channel-A of locus i of         chromosome-j. Similarly, t_(ij) ^(C) is the ct value on         channel-C of locus i of chromosome-j. (A is just a logical name         and denotes the major allele value at the locus, while C denotes         the minor allele value at the locus.)     -   Q represents a unit-amount of genetic material such that, if the         copy number of chromosome-j is n_(j), then the total amount of         genetic material at any locus of chromosome-j is n_(j)Q. For         example, under trisomy, if a locus were AAC, then the amount of         A-material at this locus would be 2Q, the amount of C-material         at this locus is Q, and the total combined amount of genetic         material at this locus is 3Q.     -   (n^(A),n^(C)) denotes an unordered allele patterns at a locus         when the copy number for the associate chromosome is n. n^(A) is         the number of times allele A appears on the locus and n^(C) is         the number of times allele C appears on the locus. Each can take         on values in 0, . . . n, and it must be the case that         n^(A)+n^(C)=n. For example, under trisomy, the set of allele         patterns is {(0,3), (1,2), (2,1), (3,0)}. The allele pattern         (2,1) for example corresponds to a locus value of A²C, i.e.,         that two chromosomes have allele value A and the third has an         allele value of C at the locus. Under disomy, the set of allele         patterns is {(0,2), (1,1), (2,0)}. Under monosomy, the set of         allele patterns is {(0,1), (1,0)}.     -   Q_(T) is the (known) threshold value from the fundamental TAQMAN         equation Q₀2^(βt)=Q^(T).     -   β is the (known) doubling-rate from the fundamental TAQMAN         equation Q₀2^(βt)=Q_(T).     -   ⊥ (pronounced “bottom”) is the ct value that is interpreted as         meaning “no signal”.     -   f_(Z)(x) is the standard normal Gaussian pdf evaluated at x.     -   σ is the (known) standard deviation of the noise on TAQMAN ct         values.

MAP Solution

In the solution below, the following assumptions have been made:

-   -   N₇ and N_(X) are independent.     -   Allele values on neighboring loci are independent.

The goal is to classify the copy number of a designated chromosome. In this case, the description will focus on chromosome 7. The MAP solution is given by:

$\begin{matrix} {{\hat{n}}_{7} = {{\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{P\left( {n_{7},\left. D \middle| Q \right.} \right)}{Q}}}} = {{\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{\sum\limits_{n_{X} \in {\{{1,2,3}\}}}{{P\left( {n_{7},n_{X},\left. D \middle| Q \right.} \right)}{Q}}}}}} = {{\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{\sum\limits_{n_{X} \in {\{{1,2,3}\}}}{{P\left( n_{7} \right)}{P\left( n_{X} \right)}{P\left( {\left. D_{7} \middle| Q \right.,n_{7}} \right)}{P\left( {\left. D_{X} \middle| Q \right.,n_{X}} \right)}{Q}}}}}} = {{\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{7} \right)}{P\left( {\left. D_{7} \middle| Q \right.,n_{7}} \right)}} \right)\left( {\sum\limits_{n_{X} \in {\{{1,2,3}\}}}{{P\left( n_{X} \right)}{P\left( {\left. D_{X} \middle| Q \right.,n_{X}} \right)}}} \right){Q}}}} = {{\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{7} \right)}{\prod\limits_{i}{P\left( {t_{i,7}^{A},\left. t_{i,7}^{C} \middle| Q \right.,n_{7}} \right)}}} \right)\left( {\sum\limits_{n_{X} \in {\{{1,2,3}\}}}{{P\left( n_{X} \right)}{\prod\limits_{i}{P\left( {t_{i,X}^{A},\left. t_{i,X}^{C} \middle| Q \right.,n_{X}} \right)}}}} \right){Q}}}} = {\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{7} \right)}{\prod\limits_{i}{\sum\limits_{{n^{A} + n^{C}} = n_{7}}{{P\left( {n^{A},\left. n^{C} \middle| n_{7} \right.,i} \right)}{P\left( {\left. t_{i,7}^{A} \middle| Q \right.,n^{A}} \right)}{P\left( {\left. t_{i,7}^{C} \middle| Q \right.,n^{C}} \right)}}}}} \right) \times \left( {\sum\limits_{n_{X} \in {\{{1,2,3}\}}}{{P\left( n_{X} \right)}{\prod\limits_{i}{\sum\limits_{{n^{A} + n^{C}} = n_{X}}{{P\left( {n^{A},\left. n^{C} \middle| n_{X} \right.,i} \right)}{P\left( {\left. t_{i,X}^{A} \middle| Q \right.,n^{A}} \right)}{P\left( {\left. t_{i,X}^{C} \middle| Q \right.,n^{C}} \right)}}}}}} \right){Q}}}}}}}}}} & \left. {(*} \right) \end{matrix}$

Allele Distribution Model

Equation (*) depends on being able to calculate values for P(n^(A),n^(C)|n₇,i) and P(n^(A),n^(C)|n_(X),i). These values may be calculated by assuming that the allele pattern (n^(A),n^(C)) is drawn i.i.d (independent and identically distributed) according to the allele frequencies for its letters at locus i. An example should suffice to illustrate this. Calculate P((2,1)|n₇=3) under the assumption that the allele frequency for A is 60%, and the minor allele frequency for C is 40%. (As an aside, note that P((2,1)|n₇=2)=0, since in this case the pair must sum to 2.) This probability is given by

${P\left( {\left. \left( {2,1} \right) \middle| n_{7} \right. = 3} \right)} = {\begin{pmatrix} 3 \\ 2 \end{pmatrix}({.60})^{2}({.40})}$

The general equation is

${P\left( {n^{A},\left. n^{C} \middle| n_{j} \right.,i} \right)} = {\begin{pmatrix} n \\ n^{A} \end{pmatrix}\left( {1 - p_{ij}} \right)^{n^{A}}\left( p_{ij} \right)^{n^{C}}}$

Where p_(ij) is the minor allele frequency at locus i of chromosome j.

Error Model

Equation (*) depends on being able to calculate values for P(t^(A)|Q,n^(A)) and P(t^(C)|Q,n^(C)) For this an error model is needed. One may use the following error model:

${P\left( {\left. t^{A} \middle| Q \right.,n^{A}} \right)} = \begin{Bmatrix} p_{d} & {t^{A} = {\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}} > 0}} \\ {\left( {1 - p_{d}} \right){f_{Z}\left( {\frac{1}{\sigma}\left( {t^{A} - {\frac{1}{\beta}\log \frac{Q_{T}}{n^{A}Q}}} \right)} \right)}} & {t^{A}\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}} > 0} \\ {1 - p_{a}} & {t^{A} = {{\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}}} = 0}} \\ {2p_{a}{f_{Z}\left( {\frac{1}{\sigma}\left( {{t^{A} -}\bot} \right)} \right)}} & {t^{A}\bot\mspace{11mu} {{{and}\mspace{14mu} n^{A}} - 0}} \end{Bmatrix}$

Each of the four cases mentioned above is described here. In the first case, no signal is received, even though there was A-material on the locus. That is a dropout, and its probability is therefore p_(d). In the second case, a signal is received, as expected since there was A-material on the locus. The probability of this is the probability that a dropout does not occur, multiplied by the pdf for the distribution on the ct value when there is no dropout. (Note that, to be rigorous, one should divide through by that portion of the probability mass on the Gaussian curve that lies below ⊥, but this is practically one, and will be ignored here.) In the third case, no signal was received and there was no signal to receive. This is the probability that no drop-in occurred, 1−p_(a). In the final case, a signal is received even through there was no A-material on the locus. This is the probability of a drop-in multiplied by the pdf for the distribution on the ct value when there is a drop-in. Note that the ‘2’ at the beginning of the equation occurs because the Gaussian distribution in the case of a drop-in is modeled as being centered at ⊥. Thus, only half of the probability mass lies below ⊥ in the case of a drop-in, and when the equation is normalized by dividing through by one-half, it is equivalent to multiplying by 2. The error model for P(t^(C)|Q,n^(C)) by symmetry is the same as for P(t^(A)|Q,n^(A)) above. It should be obvious to one skilled in the art how different error models can be applied to a range of different genotyping platforms, for example the ILLUMINA INFINIUM genotyping platform.

Computational Considerations

In one embodiment of the invention, the MAP estimation mathematics can be carried out by brute-force as specified in the final MAP equation, except for the integration over Q. Since doubling Q only results in a difference in ct value of 1/β, the equations are sensitive to Q only on the log scale. Therefore to do the integration it should be sufficient to try a handful of Q-values at different powers of two and to assume a uniform distribution on these values. For example, one could start at Q=Q_(T)2^(−20β), which is the quantity of material that would result in a ct value of 20, and then halve it in succession twenty times, yielding a final Q value that would result in a ct value of 40.

What follows is a re-derivation of a derivation described elsewhere in this disclosure, with slightly difference emphasis, for elucidating the programming of the math. Note that the variable D below is not really a variable. It is always a constant set to the value of the data set actually in question, so it does not introduce another array dimension when representing in MATLAB. However, the variables D_(j) do introduce an array dimension, due to the presence of the index j.

$\mspace{20mu} {{\hat{n}}_{7} = {\underset{n_{7} \in {\{{1,2,3}\}}}{\arg \; \max}\; {P\left( {n_{7},D} \right)}}}$ $\mspace{20mu} {{P\left( {n_{7},D} \right)} = {\sum\limits_{Q}{P\left( {n_{7},Q,D} \right)}}}$   P(n₇, Q, D) = P(n₇)P(Q)P(D₇|Q, n₇)P(D_(X)|Q) $\mspace{20mu} {{P\left( D_{j} \middle| Q \right)} = {\sum\limits_{n_{j} \in {\{{1,2,3}\}}}{P\left( {D_{j},\left. n_{j} \middle| Q \right.} \right)}}}$   P(D_(j), n_(j)|D) = P(n_(j))P(D_(j)|Q, n_(j)) $\mspace{20mu} {{P\left( {\left. D_{j} \middle| Q \right.,n_{j}} \right)} = {\prod\limits_{i}{P\left( {\left. D_{ij} \middle| Q \right.,n_{j}} \right)}}}$ $\mspace{20mu} {{P\left( {\left. D_{ij} \middle| Q \right.,n_{j}} \right)} = {\sum\limits_{{n^{A} + n^{C}} = n_{j}}{P\left( {D_{ij},n^{A},\left. n^{C} \middle| Q \right.,n_{j}} \right)}}}$ P(D_(ij), n^(A), n^(C)|Q, n_(j)) = P(n^(A), n^(C)|n_(j), i)P(t_(ij)^(A)|Q, n^(A))P(t_(ij)^(C)|Q, n^(C)) $\mspace{20mu} {{P\left( {n^{A},\left. n^{C} \middle| n_{j} \right.,i} \right)} = {\begin{pmatrix} n \\ n^{A} \end{pmatrix}\left( {1 - p_{ij}} \right)^{n^{A}}\left( p_{ij} \right)^{n^{C}}}}$ ${P\left( {\left. t_{ij}^{A} \middle| Q \right.,n^{A}} \right)} = \begin{Bmatrix} p_{d} & {t^{A} = {\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}} > 0}} \\ {\left( {1 - p_{d}} \right){f_{Z}\left( {\frac{1}{\sigma}\left( {t^{A} - {\frac{1}{\beta}\log \frac{Q_{T}}{n^{A}Q}}} \right)} \right)}} & {t^{A}\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}} > 0} \\ {1 - p_{a}} & {t^{A} = {{\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}}} = 0}} \\ {2p_{d}{f_{Z}\left( {\frac{1}{\sigma}\left( {{t^{A} -}\bot} \right)} \right)}} & {{t^{A}\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}}} = 0} \end{Bmatrix}$

E MAP Detection of Aneuploidy with Parental Info

In one embodiment of the invention, the disclosed method enables one to make aneuploidy calls on each chromosome of each blastomere, given multiple blastomeres with measurements at some loci on all chromosomes, where it is not known how many copies of each chromosome there are. In this embodiment, the a MAP estimation is used to classify the copy number N_(j) of chromosome where jε{1,2 . . . 22, X, Y}, from among the choices {0, 1, 2, 3} given the measurements D, which includes both genotyping information of the blastomeres and the parents. To be general, let jε{1, 2 . . . m} where m is the number of chromosomes of interest; m=24 implies that all chromosomes are of interest. Formally, this looks like:

${\hat{n}}_{j} = {\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{P\left( {n_{j},D} \right)}}$

Unfortunately, it is not possible to calculate this probability, because the probability depends on an unknown random variable Q that describes the amplification factor of MDA. If the distribution f on Q were known, then it would be possible to solve the following:

${\hat{n}}_{j} = {\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{P\left( {n_{j},\left. D \middle| Q \right.} \right)}{Q}}}}$

In practice, a continuous distribution on Q is not known. However, identifying Q to within a power of two is sufficient, and in practice a probability mass function (pmf) on Q that is uniform on say {2¹,2², . . . , 2⁴⁰} can be used. In the development that follows, the integral sign will be used as though a probability distribution function (pdf) on Q were known, even though in practice a uniform pmf on a handful of exponential values of Q will be substituted.

This discussion will use the following notation and definitions:

N_(a) is the copy number of autosomal chromosome a, where aε{1,2 . . . 22}. It is a random variable. n_(a) denotes a potential value for N_(a).

N_(X) is the copy number of chromosome X. n_(X) denotes a potential value for N_(X).

N_(j) is the copy number of chromosome-j, where for the purposes here jε{1, 2 . . . m}. n_(j) denotes a potential value for N_(j).

m is the number of chromosomes of interest, m=24 when all chromosomes are of interest.

H is the set of aneuploidy states. hεH. For the purposes of this derivation, let H={paternal monosomy, maternal monosomy, disomy, t1 paternal trisomy, t2 paternal trisomy, t1 maternal trisomy, t2 maternal trisomy}. Paternal monosomy means the only existing chromosome came from the father; paternal trisomy means there is one additional chromosome coming from father. Type 1 (t1) paternal trisomy is such that the two paternal chromosomes are sister chromosomes (exact copy of each other) except in case of crossover, when a section of the two chromosomes are the exact copies. Type 2 (t2) paternal trisomy is such that the two paternal chromosomes are complementary chromosomes (independent chromosomes coming from two grandparents). The same definitions apply to the maternal monosomy and maternal trisomies.

D is the set of all measurements including measurements on embryo D_(E) and on parents D_(F), D_(M). In the case where these are TAQMAN measurements on all chromosomes, one can say: D={D₁,D₂, . . . D_(m)}, D_(E)={D_(E,1),D_(E,2), . . . D_(E,m)}, where D_(k)=(D_(E,k),D_(F,k),D_(M,k)), D_(Ej)={t_(E,ij) ^(A),t_(E,ij) ^(C)} is the set of TAQMAN measurements on chromosome j.

t_(E,ij) ^(A) is the ct value on channel-A of locus i of chromosome-j. Similarly, t_(E,ij) ^(C) is the ct value on channel-C of locus i of chromosome-j. (A is just a logical name and denotes the major allele value at the locus, while C denotes the minor allele value at the locus.)

Q represents a unit-amount of genetic material after MDA of single cell's genomic DNA such that, if the copy number of chromosome-j is n_(j), then the total amount of genetic material at any locus of chromosome-j is n_(j)Q. For example, under trisomy, if a locus were AAC, then the amount of A-material at this locus is 2Q, the amount of C-material at this locus is Q, and the total combined amount of genetic material at this locus is 3Q.

q is the number of numerical steps that will be considered for the value of Q.

N is the number of SNPs per chromosome that will be measured.

(n^(A),n^(C)) denotes an unordered allele patterns at a locus when the copy number for the associated chromosome is n. n^(A) is the number of times allele A appears on the locus and n^(C) is the number of times allele C appears on the locus. Each can take on values in 0, . . . , n, and it must be the case that n^(A)+n^(C)=n. For example, under trisomy, the set of allele patterns is {(0,3), (1,2),(2,1),(3,0)}. The allele pattern (2,1) for example corresponds to a locus value of A²C, i.e., that two chromosomes have allele value A and the third has an allele value of C at the locus. Under disomy, the set of allele patterns is {(0,2), (1,1), (2,0)}. Under monosomy, the set of allele patterns is {(0,1), (1,0)}.

Q_(T) is the (known) threshold value from the fundamental TAQMAN equation Q₀2^(βt)=Q_(T).

β is the (known) doubling-rate from the fundamental TAQMAN equation Q₀2^(βt)=Q_(T).

⊥ (pronounced “bottom”) is the ct value that is interpreted as meaning “no signal”.

f_(Z)(x) is the standard normal Gaussian pdf evaluated at x.

σ is the (known) standard deviation of the noise on TAQMAN ct values.

MAP Solution

In the solution below, the following assumptions are made:

N_(j)s are independent of one another.

Allele values on neighboring loci are independent.

The goal is to classify the copy number of a designated chromosome. For instance, the MAP solution for chromosome a is given by

$\begin{matrix} {{\hat{n}}_{j} = {{\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{P\left( {n_{j},\left. D \middle| Q \right.} \right)}{Q}}}} = {{\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{\sum\limits_{n_{1} \in {\{{1,2,3}\}}}{\ldots {\sum\limits_{n_{j - 1} \in {\{{1,2,3}\}}}{\sum\limits_{n_{j + 1} \in {\{{1,2,3}\}}}{\ldots {\sum\limits_{n_{m} \in {\{{1,2,3}\}}}{{P\left( {n_{1},{\ldots \mspace{14mu} n_{m}},\left. D \middle| Q \right.} \right)}{Q}}}}}}}}}}} = {{\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}{\sum\limits_{n_{1} \in {\{{1,2,3}\}}}{\ldots {\sum\limits_{n_{j - 1} \in {\{{1,2,3}\}}}{\sum\limits_{n_{j + 1} \in {\{{1,2,3}\}}}{\ldots {\sum\limits_{n_{m} \in {\{{1,2,3}\}}}{\overset{m}{\prod\limits_{k = 1}}{{P\left( n_{k} \right)}{P\left( {\left. D_{k} \middle| Q \right.,n_{k}} \right)}{Q}}}}}}}}}}}} = {{\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{j} \right)}{P\left( {\left. D_{j} \middle| Q \right.,n_{j}} \right)}} \right)\left( {\prod\limits_{k \neq j}{\sum\limits_{n_{k} \in {\{{1,2,3}\}}}{{P\left( n_{k} \right)}{P\left( {\left. D_{k} \middle| Q \right.,n_{k}} \right)}}}} \right){Q}}}} = {{\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{j} \right)}{\sum\limits_{h \in H}{{P\left( {\left. D_{j} \middle| Q \right.,n_{j},h} \right)}{P\left( h \middle| n_{j} \right)}}}} \right)\left( {\prod\limits_{k \neq j}{\sum\limits_{n_{k} \in {\{{1,2,3}\}}}{{P\left( n_{k} \right)}{\sum\limits_{h \in H}{{P\left( {\left. D_{k} \middle| Q \right.,n_{k},h} \right)}{P\left( h \middle| n_{k} \right)}}}}}} \right){Q}}}} = {{\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{j} \right)}{\sum\limits_{h \in H}{{P\left( h \middle| n_{j} \right)}{\prod\limits_{i}{P\left( {t_{E,{ij}}^{A},t_{E,{ij}}^{C},\left. {D_{F,{ij}}D_{M,{ij}}} \middle| Q \right.,n_{j},h} \right)}}}}} \right) \times \left( {\prod\limits_{k \neq j}{\sum\limits_{n_{k} \in {\{{1,2,3}\}}}{{P\left( n_{k} \right)}{\sum\limits_{h \in H}{{P\left( h \middle| n_{k} \right)}{\prod\limits_{i}{P\left( {t_{E,{ik}}^{A},t_{E,{ik}}^{C},\left. {D_{F,{ik}}D_{M,{ik}}} \middle| Q \right.,n_{k},h} \right)}}}}}}} \right){Q}}}} = {{\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{j} \right)}{\sum\limits_{h \in H}{{P\left( h \middle| n_{j} \right)}{\prod\limits_{i}{\sum\limits_{\underset{{n_{M}^{A} + n_{M}^{C}} = 2}{{n_{F}^{A} + n_{F}^{C}} = 2}}{{P\left( {n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{M}^{C}} \right)}{P\left( {t_{E,{ij}}^{A},t_{E,{ij}}^{C},\left. {D_{F,{ij}}D_{M,{ij}}} \middle| Q \right.,n_{j},h,n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{m}^{C}} \right)}}}}}}} \right) \times \left( {\prod\limits_{k \neq j}{\sum\limits_{n_{k} \in {\{{1,2,3}\}}}{{P\left( n_{k} \right)}{\sum\limits_{h \in H}{{P\left( h \middle| n_{k} \right)}{\prod\limits_{i}{\sum\limits_{\underset{{n_{M}^{A} + n_{M}^{C}} = 2}{{n_{F}^{A} + n_{F}^{C}} = 2}}{{P\left( {n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{M}^{C}} \right)}{P\left( {t_{E,{ik}}^{A},t_{E,{ik}}^{C},\left. {D_{F,{ik}}D_{M,{ik}}} \middle| Q \right.,n_{k},h,n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{M}^{C}} \right)}}}}}}}}} \right){Q}}}} = {\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{j} \right)}{\sum\limits_{h \in H}{{P\left( h \middle| n_{j} \right)}{\prod\limits_{i}{\sum\limits_{\underset{{n_{M}^{A} + n_{M}^{C}} = 2}{{n_{F}^{A} + n_{F}^{C}} = 2}}{{P\left( {n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{m}^{C}} \right)}{P\left( t_{F,{ij}}^{A} \middle| {n_{F}^{A}Q^{\prime}} \right)}{P\left( t_{F,{ij}}^{C} \middle| {n_{F}^{C}Q^{\prime}} \right)}{P\left( t_{M,{ij}}^{A} \middle| {n_{M}^{A}Q^{\prime}} \right)}{P\left( t_{M,{ij}}^{C} \middle| {n_{M}^{C}Q^{\prime}} \right)} \times {\sum\limits_{{n^{A} + n^{C}} = n_{j}}{{P\left( {n^{A},\left. n^{C} \middle| n_{j} \right.,h,n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{M}^{C}} \right)}{P\left( {\left. t_{E,{ij}}^{A} \middle| Q \right.,n^{A}} \right)}{P\left( {\left. t_{E,{ij}}^{C} \middle| Q \right.,n^{C}} \right)}}}}}}}}} \right) \times \left( {\prod\limits_{k \neq j}{\sum\limits_{n_{k} \in {\{{1,2,3}\}}}{{P\left( n_{k} \right)}{\sum\limits_{h \in H}{{P\left( h \middle| n_{k} \right)}{\prod\limits_{i}{\sum\limits_{\underset{{n_{M}^{A} + n_{M}^{C}} = 2}{{n_{F}^{A} + n_{F}^{C}} = 2}}{{P\left( {n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{M}^{C}} \right)}{P\left( {t_{F,{ik}}^{A},{n_{F}^{A}Q^{\prime}}} \right)}{P\left( t_{F,{ik}}^{C} \middle| {n_{F}^{C}Q^{\prime}} \right)}{P\left( t_{M,{ik}}^{A} \middle| {n_{M}^{A}Q^{\prime}} \right)}{P\left( t_{M,{ik}}^{C} \middle| {n_{M}^{C}Q^{\prime}} \right)} \times {\sum\limits_{{n^{A} + n^{C}} = n_{k}}{{P\left( {n^{A},\left. n^{C} \middle| n_{k} \right.,h,n_{F}^{A},n_{F}^{C},n_{M}^{A},n_{M}^{C}} \right)}{P\left( {t_{E,{ik}}^{A},{n^{A}Q}} \right)}{P\left( t_{E,{ik}}^{C} \middle| {n^{C}Q} \right)}}}}}}}}}}} \right){Q}}}}}}}}}}}} & \left. {(*} \right) \end{matrix}$

Here it is assumed that Q′, the Q are known exactly for the parental data.

Copy Number Prior Probability

Equation (*) depends on being able to calculate values for P(n_(a)) and P(n_(X)), the distribution of prior probabilities of chromosome copy number, which is different depending on whether it is an autosomal chromosome or chromosome X. If these numbers are readily available for each chromosome, they may be used as is. If they are not available for all chromosomes, or are not reliable, some distributions may be assumed. Let the prior probability

${P\left( {n_{a} = 1} \right)} = {{P\left( {n_{a} = 2} \right)} = {{P\left( {n_{a} = 3} \right)} = \frac{1}{3}}}$

for autosomal chromosomes, let the probability of sex chromosomes being XY or XX be ½.

${{P\left( {n_{X} = 0} \right)} = {{\frac{1}{3} \times \frac{1}{4}} = \frac{1}{12}}},{{P\left( {n_{X} = 1} \right)} = {{{\frac{1}{3} \times \frac{3}{4}} + {\frac{1}{3} \times \frac{1}{2}} + {\frac{1}{3} \times \frac{1}{2} \times \frac{1}{4}}} = {\frac{11}{24} = 0.458}}},$

where ¾ is the probability of the monosomic chromosome being X (as oppose to Y), ½ is the probability of being XX for two chromosomes and ¼ is the probability of the third chromosome being Y.

${{P\left( {n_{X} = 3} \right)} = {{\frac{1}{3} \times \frac{1}{2} \times \frac{3}{4}} = {\frac{1}{8} = 0.125}}},$

where ½ is the probability of being XX for two chromosomes and ¾ is the probability of the third chromosome being X.

${P\left( {n_{X} = 2} \right)} = {{1 - {P\left( {n_{X} = 0} \right)} - {P\left( {n_{X} - 1} \right)} - {P\left( {n_{X} = 3} \right)}} = {\frac{4}{12} = {0.333.}}}$

Aneuploidy State Prior Probability

Equation (*) depends on being able to calculate values for P(h|n_(j)), and these are shown in Table 6. The symbols used in the Table 6 are explained below

Symbol Meaning Ppm paternal monosomy probability Pmm maternal monosomy probability Ppt paternal trisomy probability given trisomy Pmt maternal trisomy probability given trisomy pt1 probability of type 1 trisomy for paternal trisomy, or P (type 1|paternal trisomy) pt2 probability of type 2 trisomy for paternal trisomy, or P (type 2|paternal trisomy) mt1 probability of type 1 trisomy for maternal trisomy, or P (type 1|maternal trisomy) mt2 probability of type 2 trisomy for maternal trisomy, or P (type 2|maternal trisomy) Note that there are many other ways that one skilled in the art, after reading this disclosure, could assign or estimate appropriate prior probabilities without changing the essential concept of the patent.

Allele Distribution Model Without Parents

Equation (*) depends on being able to calculate values for P(n^(A),n^(C)|n_(a),i) and P(n^(A),n^(C)|n_(X),i). These values may be calculated by assuming that the allele pattern (n^(A),n^(C)) is drawn i.i.d according to the allele frequencies for its letters at locus i. An illustrative example is given here. Calculate P((2,1)|n₇=3) under the assumption that the allele frequency for A is 60%, and the minor allele frequency for C is 40%. (As an aside, note that P((2,1)|n₇=2)=0, since in this case the pair must sum to 2.) This probability is given by P((2,1)|n₇=3)=₂ ³) (,60)²(,40)

The general equation is

P(n ^(A) ,n ^(C) |n _(j) ,i)=_(n) _(A) ^(n))(1−p _(ij))^(n) ^(A) (p _(ij))^(n) ^(C)

Where p_(ij) is the minor allele frequency at locus i of chromosome j.

Allele Distribution Model Incorporating Parental Genotypes

Equation (*) depends on being able to calculate values for P(n^(A),n^(C)|n_(j),h,T_(F,ij)T_(M,ij)) which are listed in Table 7. In a real situation, LDO will be known in either one of the parents, and the table would need to be augmented. If LDO are known in both parents, one can use the model described in the Allele Distribution Model without Parents section.

Population Frequency for Parental Truth

Equation (*) depends on being able to calculate P(T_(F,ij),T_(M,ij)). The probabilities of the combinations of parental genotypes can be calculated based on the population frequencies. For example, P(AA,AA)=P(A)⁴, and P(AC,AC)=P_(heteroz) ² where P_(heteroz)=2P(A)P(C) is the probability of a diploid sample to be heterozygous at one locus i.

Error Model

Equation (*) depends on being able to calculate values for P(t^(A)|Q,n^(A)) and P(t^(C)|Q,n^(C)). For this an error model is needed. One may use the following error model:

${P\left( {\left. t^{A} \middle| Q \right.,n^{A}} \right)} = \begin{Bmatrix} p_{d} & {t^{A} = {\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}} > 0}} \\ {\left( {1 - p_{d}} \right){f_{Z}\left( {\frac{1}{\sigma}\left( {t^{A} - {\frac{1}{\beta}\log \frac{Q_{T}}{n^{A}Q}}} \right)} \right)}} & {t^{A}\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}} > 0} \\ {1 - p_{a}} & {t^{A} = {{\bot\mspace{11mu} {{and}\mspace{14mu} n^{A}}} = 0}} \\ {2p_{d}{f_{Z}\left( {\frac{1}{\sigma}\left( {{t^{A} -}\bot} \right)} \right)}} & {t^{A}\bot\mspace{11mu} {{{and}\mspace{14mu} n^{A}} - 0}} \end{Bmatrix}$

This error model is used elsewhere in this disclosure, and the four cases mentioned above are described there. The computational considerations of carrying out the MAP estimation mathematics can be carried out by brute-force are also described in the same section.

Computational Complexity Estimation

Rewrite the equation (*) as follows,

$\begin{matrix} {{\hat{n}}_{j} = {\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{\int{{f(Q)}\left( {{P\left( n_{j} \right)}{\prod\limits_{i}\; {\sum\limits_{{n^{A} + n^{C}} = n_{j}}{{P\left( {n^{A},\left. n^{C} \middle| n_{j} \right.,i} \right)}{P\left( {\left. t_{i,j}^{A} \middle| Q \right.,n^{A}} \right)}{P\left( {\left. t_{i,j}^{C} \middle| Q \right.,n^{C}} \right)}}}}} \right) \times \left( {\prod\limits_{k \neq j}\; {\sum\limits_{n_{k} \in {\{{1,2,3}\}}}{{P\left( n_{k} \right)}{\prod\limits_{i}\; {\sum\limits_{{n^{A} + n^{C}} = n_{k}}{{P\left( {n^{A},\left. n^{C} \middle| n_{k} \right.,i} \right)}{P\left( {\left. t_{i,k}^{A} \middle| Q \right.,n^{A}} \right)}{P\left( {\left. t_{i,k}^{C} \middle| Q \right.,n^{C}} \right)}}}}}}} \right){Q}}}}} & \left. {(*} \right) \end{matrix}$

Let the computation time for P(n^(A),n^(C)|n_(j),i) be t_(x), that for P(t_(i,j) ^(A)|Q,n^(A)) or P(t_(i,j) ^(C)|Q,n^(C)) be t_(y). Note that P(n^(A),n^(C)|n_(j), i) may be pre-computed, since their values don't vary from experiment to experiment. For the discussion here, call a complete 23-chromosome aneuploidy screen an “experiment”. Computation of Π_(i)Σ_(n) _(A) _(+n) _(C) _(=n) ^(j) P(n^(A),n^(C)|n_(j),i)P(t_(i,j) ^(A)|Q,n^(A))P(t_(i,j) ^(C)|Q,n^(C)) for 23 chromosomes takes

if n _(j)=1,(2+t _(x)+2*t _(y))*2N*m

if n _(j)=2,(2+t _(x)+2*t _(y))*3N*m

if n _(j)=3,(2+t _(x)+2*t _(y))*4N*m

The unit of time here is the time for a multiplication or an addition. In total, it takes (2+t_(x)+2*t_(y))*9N*m

Once these building blocks are computed, the overall integral may be calculated, which takes time on the order of (2+t_(x)+2*t_(y))*9N*m*q. In the end, it takes 2*m comparisons to determine the best estimate for n_(j). Therefore, overall the computational complexity is O(N*m*q).

What follows is a re-derivation of the original derivation, with a slight difference in emphasis in order to elucidate the programming of the math. Note that the variable D below is not really a variable. It is always a constant set to the value of the data set actually in question, so it does not introduce another array dimension when representing in MATLAB. However, the variables D_(j) do introduce an array dimension, due to the presence of the index j.

$\mspace{20mu} {{\hat{n}}_{j} = {\underset{n_{j} \in {\{{1,2,3}\}}}{\arg \; \max}{P\left( {n_{j},D} \right)}}}$ $\mspace{20mu} {{P\left( {n_{j},D} \right)} = {\sum\limits_{Q}{P\left( {n_{j},Q,D} \right)}}}$   P(n_(j), Q, D) = P(n_(j))P(Q)P(D_(j)|Q, n_(j))P(D_(k ≠ j)|Q) $\mspace{20mu} {{P\left( D_{j} \middle| Q \right)} = {\sum\limits_{n_{j} \in {\{{1,2,3}\}}}{P\left( {D_{j}n_{j}} \middle| Q \right)}}}$   P(D_(j), n_(j)|Q) = P(n_(j))P(D_(j)|Q, n_(j)) $\mspace{20mu} {{P\left( {\left. D_{j} \middle| Q \right.,n_{j}} \right)} = {\prod\limits_{i}{P\left( {\left. D_{ij} \middle| Q \right.,n_{j}} \right)}}}$ $\mspace{20mu} {{P\left( {\left. D_{ij} \middle| Q \right.,n_{j}} \right)} = {\sum\limits_{{n^{A} + n^{C}} = n_{j}}{P\left( {D_{ij},n^{A},\left. n^{C} \middle| Q \right.,n_{j}} \right)}}}$   P(D_(ij)n^(A), n^(C)|Q, n_(j)) = P(n^(A), n^(C)|n_(j), i)P(t_(ij)^(A)|Q, n^(A))P(t_(ij)^(C)|Q, n^(C)) $\mspace{20mu} {{P\left( {n^{A},\left. n^{C} \middle| n_{j} \right.,i} \right)} = {\begin{pmatrix} n \\ n^{A} \end{pmatrix}\left( {1 - p_{ij}} \right)^{n^{A}}\left( p_{ij} \right)^{n^{C}}}}$ ${P\left( {\left. t_{ij}^{A} \middle| Q \right.,n^{A}} \right)} = \begin{Bmatrix} p_{d} & {t^{A} = {\bot\mspace{14mu} {{and}\mspace{14mu} n^{A}} > 0}} \\ {\left( {1 - p_{d}} \right){f_{Z}\left( {\frac{1}{\sigma}\left( {t^{A} - {\frac{1}{\beta}\log \frac{Q_{T}}{n^{A}Q}}} \right)} \right)}} & {t^{A} \neq \bot\mspace{14mu} {{and}\mspace{14mu} n^{A}} > 0} \\ {1 - p_{a}} & {t^{A} = {{\bot\mspace{14mu} {{and}\mspace{14mu} n^{A}}} = 0}} \\ {2p_{a}{f_{Z}\left( {\frac{1}{\sigma}\left( {{t^{A} -}\bot} \right)} \right)}} & {{t^{A} \neq \bot\mspace{14mu} {{and}\mspace{14mu} n^{A}}} = 0} \end{Bmatrix}$

F Qualitative Chromosome Copy Number Calling

One way to determine the number of copies of a chromosome segment in the genome of a target individual by incorporating the genetic data of the target individual and related individual(s) into a hypothesis, and calculating the most likely hypothesis is described here. In one embodiment of the invention, the aneuploidy calling method may be modified to use purely qualitative data. There are many approaches to solving this problem, and several of them are presented here. It should be obvious to one skilled in the art how to use other methods to accomplish the same end, and these will not change the essence of the disclosure.

Notation for Qualitative CNC

1. N is the total number of SNPs on the chromosome. 2. n is the chromosome copy number. 3. n^(M) is the number of copies supplied to the embryo by the mother: 0, 1, or 2. 4. n^(F) is the number of copies supplied to the embryo by the father: 0, 1, or 2. 5. p_(d) is the dropout rate, and f(p_(d)) is a prior on this rate. 6. p_(a) is dropin rate, and f(p_(d)) is a prior on this rate. 7. c is the cutoff threshold for no-calls. 8. D=(x_(k),y_(k)i) is the platform response on channels X and Y for SNP k. 9. D(c)={G(x_(k),y_(k)); c}={ĝ_(k) ^((c))} is the set of genotype calls on the chromosome. Note that the genotype calls depend on the no-call cutoff threshold c. 10. ĝ_(k) ^((c)) is the genotype call on the k-th SNP (as opposed to the true value): one of AA, AB, BB, or NC (no-call). 11. Given a genotype call ĝ at SNP k, the variables (ĝ_(X), ĝ_(Y)) are indicator variables (1 or 0), indicating whether the genotype ĝ implies that channel X or Y has “lit up”. Formally, ĝ_(X)=1 just in case ĝ contains the allele A, and ĝ_(Y)=1 just in case ĝ contains the allele B. 12. M={g_(k) ^(M)} is the known true sequence of genotype calls on the mother. g^(M) refers to the genotype value at some particular locus. 13. {g_(k) ^(F)} is the known true sequence of genotype calls on the father. g^(F) refers to the genotype value at some particular locus. 14. n^(A),n^(B) are the true number of copies of A and B on the embryo (implicitly at locus k), respectively. Values must be in {0, 1, 2, 3,4}. 15. c_(M) ^(A),c_(M) ^(B) are the number of A alleles and B alleles respectively supplied by the mother to the embryo (implicitly at locus k). The values must be in {0, 1, 2}, and must not sum to more than 2. Similarly, c_(F) ^(A),c_(F) ^(B) are the number of A alleles and B alleles respectively supplied by the father to the embryo (implicitly at locus k). Altogether, these four values exactly determine the true genotype of the embryo. For example, if the values were (1,0) and (1,1), then the embryo would have type AAB.

Solution 1: Integrate Over Dropout and Dropin Rates.

In the embodiment of the invention described here, the solution applies to just a single chromosome. In reality, there is loose coupling among all chromosomes to help decide on dropout rate p_(d), but the math is presented here for just a single chromosome. It should be obvious to one skilled in the art how one could perform this integral over fewer, more, or different parameters that vary from one experiment to another. It should also be obvious to one skilled in the art how to apply this method to handle multiple chromosomes at a time, while integrating over ADO and ADI. Further details are given in Solution 3B below.

$\mspace{20mu} {{P\left( {\left. n \middle| {D(c)} \right.,M,F} \right)} = {\sum\limits_{{({n^{M},n^{F}})} \in n}{P\left( {n^{M},\left. n^{F} \middle| {D(C)} \right.,M,F} \right)}}}$ ${P\left( {n^{M},\left. n^{F} \middle| {D(C)} \right.,M,F} \right)} = \frac{{P\left( n^{M} \right)}{P\left( n^{F} \right)}{P\left( {\left. {D(c)} \middle| n^{M} \right.,n^{F},M,F} \right)}}{\sum\limits_{({n^{M},n^{F}})}{{P\left( n^{M} \right)}{P\left( n^{F} \right)}{P\left( {\left. {D(c)} \middle| n^{M} \right.,n^{F},M,F} \right)}}}$ P(D(c)|n^(M), n^(F), M, F) = ∫∫f(p_(d))f(p_(a))P(D(c)|n^(M), n^(F), M, F, p_(d), p_(a))p_(d)p_(a) ${P\left( {\left. {D(c)} \middle| n^{M} \right.,n^{F},M,F,p_{d},p_{a}} \right)} = {{\prod\limits_{k}{P\left( {\left. {G\left( {x_{k},{y_{k};c}} \right)} \middle| n^{M} \right.,n^{F},g_{k}^{M},g_{k}^{F},p_{d},p_{a}} \right)}} = {{\prod\limits_{\underset{\begin{matrix} {g^{F} \in {\{{{AA},{AB},{BB}}\}}} \\ {\hat{g} \in {\{{{AA},{AB},{BB},{NC}}\}}} \end{matrix}}{g^{M} \in {\{{{AA},{AB},{BB}}\}}}}{\prod\limits_{\{{{{k:g_{k}^{M}} = g^{M}},{g_{k}^{F} = g^{F}},{{\hat{g}}_{k}^{(c)} = \hat{g}}}\}}{P\left( {\left. \hat{g} \middle| n^{M} \right.,n^{F},g^{M},g^{F},p_{d},p_{a}} \right)}}} = {{\prod\limits_{\underset{\begin{matrix} {g^{F} \in {\{{{AA},{AB},{BB}}\}}} \\ {\hat{g} \in {\{{{AA},{AB},{BB},{NC}}\}}} \end{matrix}}{g^{M} \in {\{{{AA},{AB},{BB}}\}}}}{P\left( {\left. \hat{g} \middle| n^{M} \right.,n^{F},g^{M},g^{F},p_{d},p_{a}} \right)}^{{\{{{{k\text{:}g_{k}^{M}} = g^{M}},{g_{k}^{F} = g^{F}},{{\hat{g}}_{k}^{(c)} = \hat{g}}}\}}}} = {\exp\left( {\sum\limits_{\underset{\begin{matrix} {g^{F} \in {\{{{AA},{AB},{BB}}\}}} \\ {\hat{g} \in {\{{{AA},{AB},{BB},{NC}}\}}} \end{matrix}}{g^{M} \in {\{{{AA},{AB},{BB}}\}}}}{{\left\{ {{{k\text{:}\mspace{14mu} g_{k}^{M}} = g^{M}},{g_{k}^{F} = g^{F}},{{\hat{g}}_{k}^{(c)} = \hat{g}}} \right\} } \times \log \; {P\left( {\left. \hat{g} \middle| n^{M} \right.,n^{F},g^{M},g^{F},p_{d},p_{a}} \right)}}} \right)}}}}$ ${P\left( {\left. \hat{g} \middle| n^{M} \right.,n^{F},g^{M},g^{F},p_{d},p_{a}} \right)} = {\sum\limits_{n^{A},n^{B}}{\underset{\underset{{genstic}\mspace{14mu} {modeling}}{}}{P\left( {n^{A},\left. n^{B} \middle| n^{M} \right.,n^{F},g^{M},g^{F},} \right)}\overset{\overset{{platform}\mspace{14mu} {modeling}}{}}{{P\left( {\left. {\hat{g}}_{X} \middle| n^{A} \right.,p_{d},p_{a}} \right)}{P\left( {\left. {\hat{g}}_{Y} \middle| n^{B} \right.,p_{d},p_{a}} \right)}}}}$ P(ĝ_(X)|n^(A), p_(d), p_(a)) = (ĝ_(X)((1 − p_(d)^(n^(A))) + (n^(A) = 0)p_(a)) + (1 − ĝ_(X))(n^(A) > 0)p_(d)^(n^(A)) + (n^(A) = 0)(1 − p_(a)))

The derivation other is the same, except applied to channel Y.

${P\left( {n^{A},\left. n^{B} \middle| n^{M} \right.,n^{F},g^{M},g^{F},} \right)} = {\sum\limits_{\underset{{c_{M}^{B} + c_{F}^{B}} = n^{B}}{{c_{M}^{A} + c_{F}^{A}} = n^{A}}}{{P\left( {c_{M}^{A},\left. c_{M}^{B} \middle| n^{M} \right.,g^{M}} \right)}{P\left( {c_{F}^{A},\left. c_{F}^{B} \middle| n^{F} \right.,g^{F}} \right)}}}$ $\mspace{20mu} {{P\left( {c_{M}^{A},\left. c_{M}^{B} \middle| n^{M} \right.,g^{M}} \right)} = {\left( {{c_{M}^{A} + c_{M}^{B}} = n^{M}} \right)\left\{ \begin{matrix} {\left( {c_{M}^{B} = 0} \right),} & {g^{M} = {AA}} \\ {\left( {c_{M}^{A} = 0} \right),} & {g^{M} = {BB}} \\ {\frac{1}{n^{M} + 1},} & {g^{M} = {AB}} \end{matrix} \right.}}$

The other derivation is the same, except applied to the father.

Solution 2: Use ML to Estimate Optimal Cutoff Threshold c Solution 2, Variation A

$\hat{c} = {\underset{c \in {({0,a}\rbrack}}{\arg \; \max}{P\left( {\left. {D(\; c)} \middle| M \right.,F} \right)}}$ ${P(n)} = {\sum\limits_{{({n^{M},n^{F}})} \in n}{P\left( {n^{M},\left. n^{F} \middle| {D\left( \hat{c} \right)} \right.,M,F} \right)}}$

In this embodiment, one first uses the ML estimation to get the best estimate of the cutoff threshold based on the data, and then use this c to do the standard Bayesian inference as in solution 1. Note that, as written, the estimate of ĉ would still involve integrating over all dropout and dropin rates. However, since it is known that the dropout and dropin parameters tend to peak sharply in probability when they are “tuned” to their proper values with respect to c, one may save computation time by doing the following instead:

Solution 2, Variation B

$\hat{c},{\hat{p}}_{d},{{\hat{p}}_{a} = {\underset{c,p_{d},p_{a}}{\arg \; \max}{f\left( p_{d} \right)}{f\left( p_{a} \right)}{P\left( {\left. {D(\; c)} \middle| M \right.,F,p_{d},p_{a}} \right)}}}$ ${P(n)} = {\sum\limits_{{({n^{M},n^{F}})} \in n}{P\left( {n^{M},\left. n^{F} \middle| {D\left( \hat{c} \right)} \right.,M,F,{\hat{p}}_{d},{\hat{p}}_{a}} \right)}}$

In this embodiment, it is not necessary to integrate a second time over the dropout and dropin parameters. The equation goes over all possible triples in the first line. In the second line, it just uses the optimal triple to perform the inference calculation.

Solution 3: Combining Data Across Chromosomes

The data across different chromosomes is conditionally independent given the cutoff and dropout/dropin parameters, so one reason to process them together is to get better resolution on the cutoff and dropout/dropin parameters, assuming that these are actually constant across all chromosomes (and there is good scientific reason to believe that they are roughly constant). In one embodiment of the invention, given this observation, it is possible to use a simple modification of the methods in solution 3 above. Rather than independently estimating the cutoff and dropout/dropin parameters on each chromosome, it is possible to estimate them once using all the chromosomes.

Notation

Since data from all chromosomes is being combined, use the subscript j to denote the j-th chromosome. For example, D_(j)(c) is the genotype data on chromosome j using c as the no-call threshold. Similarly, M_(j),F_(j) are the genotype data on the parents on chromosome j.

Solution 3, Variation A: Use all Data to Estimate Cutoff, Dropout/Dropin

$\hat{c},{\hat{p}}_{d},{{\hat{p}}_{a} = {\underset{c,p_{d},p_{a}}{\arg \; \max}{f\left( p_{d} \right)}{f\left( p_{a} \right)}{\prod\limits_{j}{P\left( {\left. {D_{j}(\; c)} \middle| M_{j} \right.,F_{j},p_{d},p_{a}} \right)}}}}$ ${P\left( n_{j} \right)} = {\sum\limits_{{({n^{M},n^{F}})} \in n_{j}}{P\left( {n^{M},\left. n^{F} \middle| {D_{j}\left( \hat{c} \right)} \right.,M_{j},F_{j},{\hat{p}}_{d},{\hat{p}}_{a}} \right)}}$

Solution 3, Variation B:

Theoretically, this is the optimal estimate for the copy number on chromosome j.

$\left. {\left. {\left. {{{\hat{n}}_{j} = \left. {\underset{n}{\arg \; \max}{\sum\limits_{{({n^{M},n^{F}})} \in n}{\int{\int{{f\left( p_{d} \right)}{f\left( p_{a} \right)}{P\left( {D_{j}\left( \hat{\; c} \right)} \right)}}}}}} \middle| n^{M} \right.},n^{F},M_{j},F_{j},p_{d},p_{a}} \right){\prod\limits_{l \neq j}{P\left( {D_{i}\left( \hat{c} \right)} \right)}}} \middle| n^{M} \right.,n^{F},M_{l},F_{l},p_{d},p_{a}} \right){p_{d}}{p_{a}}$

Estimating Dropout/Dropin Rates from Known Samples

For the sake of thoroughness, a brief discussion of dropout and dropin rates is given here. Since dropout and dropin rates are so important for the algorithm, it may be beneficial to analyze data with a known truth model to find out what the true dropout/dropin rates are. Note that there is no single true dropout rate: it is a function of the cutoff threshold. That said, if highly reliable genomic data exists that can be used as a truth model, then it is possible to plot the dropout/dropin rates of MDA experiments as a function of the cutoff-threshold. Here a maximum likelihood estimation is used.

$\hat{c},{\hat{p}}_{d},{{\hat{p}}_{a} = {\underset{c,p_{d},p_{a}}{\arg \; \max}{\prod\limits_{jk}{P\left( {\left. {\hat{g}}_{jk}^{(c)} \middle| g_{jk} \right.,p_{d},p_{a}} \right)}}}}$

In the above equation, ĝ_(jk) ^((c)), is the genotype call on SNP k of chromosome j, using c as the cutoff threshold, while g_(jk), is the true genotype as determined from a genomic sample. The above equation returns the most likely triple of cutoff, dropout, and dropin. It should be obvious to one skilled in the art how one can implement this technique without parent information using prior probabilities associated with the genotypes of each of the SNPs of the target cell that will not undermine the validity of the work, and this will not change the essence of the invention.

G Bayesian Plus Sperm Method

Another way to determine the number of copies of a chromosome segment in the genome of a target individual is described here. In one embodiment of the invention, the genetic data of a sperm from the father and crossover maps can be used to enhance the methods described herein. Throughout this description, it is assumed that there is a chromosome of interest, and all notation is with respect to that chromosome. It is also assumed that there is a fixed cutoff threshold for genotyping. Previous comments about the impact of cutoff threshold choice apply, but will not be made explicit here. In order to best phase the embryonic information, one should combine data from all blastomeres on multiple embryos simultaneously. Here, for ease of explication, it is assumed that there is just one embryo with no additional blastomeres. However, the techniques mentioned in various other sections regarding the use of multiple blastomeres for allele-calling translate in a straightforward manner here.

Notation

-   1. n is the chromosome copy number. -   2. n^(M) is the number of copies supplied to the embryo by the     mother: 0, 1, or 2. -   3. n^(F) is the number of copies supplied to the embryo by the     father: 0, 1, or 2. -   4. p_(d) is the dropout rate, and f(p_(d)) is a prior on this rate. -   5. p_(a) is the dropin rate, and f(p_(a)) is a prior on this rate. -   6. D={ĝ_(k)} is the set of genotype measurements on the chromosome     of the embryo. ĝ_(k) is the genotype call on the k-th SNP (as     opposed to the true value): one of AA, AB, BB, or NC (no-call). Note     that the embryo may be aneuploid, in which case the true genotype at     a SNP may be, for example, AAB, or even AAAB, but the genotype     measurements will always be one of the four listed. (Note: elsewhere     in this disclosure ‘B’ has been used to indicate a heterozygous     locus. That is not the sense in which it is being used here. Here     ‘A’ and ‘B’ are used to denote the two possible allele values that     could occur at a given SNP.) -   7. M={g_(k) ^(M)} is the known true sequence of genotypes on the     mother. g_(k) ^(M) is the genotype value at the k-th SNP. -   8. F={g_(k) ^(F)} is the known true sequence of genotypes on the     father. g_(k) ^(S) is the genotype value at the k-th SNP. -   9. S={ĝ_(k) ^(S)} is the set of genotype measurements on a sperm     from the father. ĝ_(k) ^(S) is the genotype call at the k-th SNP. -   10. (m₁,m₂) is the true but unknown ordered pair of phased haplotype     information on the mother. m_(1k) is the allele value at SNP k of     the first haploid sequence. m_(2k) is the allele value at SNP k of     the second haploid sequence. (m₁,m₂)εM is used to indicate the set     of phased pairs (m₁,m₂) that are consistent with the known     genotype M. Similarly, m₁,m₂)εg_(k) ^(M) is used to indicate the set     of phased pairs that are consistent with the known genotype of the     mother at SNP k. -   11. (f₁, f₂) is the true but unknown ordered pair of phased     haplotype information on the father. f_(1k) is the allele value at     SNP k of the first haploid sequence. f_(2k) is the allele value at     SNP k of the second haploid sequence. (f₁,f₂) E F is used to     indicate the set of phased pairs (f₁,f₂) that are consistent with     the known genotype F. Similarly, (f₁,f₂)εg_(k) ^(F) is used to     indicate the set of phased pairs that are consistent with the known     genotype of the father at SNP k. -   12. s_(1k) is the true but unknown phased haplotype information on     the measured sperm from the father. s_(1k) is the allele value at     SNP k of this haploid sequence. It can be guaranteed that this sperm     is euploid by measuring several sperm and selecting one that is     euploid. -   13. χ^(M)={φ₁, . . . , φ_(n) _(M) } is the multiset of crossover     maps that resulted in maternal contribution to the embryo on this     chromosome. Similarly, χ^(F)={θ₁, . . . , θ_(n) _(F) } is the     multiset of crossover maps that results in paternal contribution to     the embryo on this chromosome. Here the possibility that the     chromosome may be aneuploid is explicitly modeled. Each parent can     contribute zero, one, or two copies of the chromosome to the embryo.     If the chromosome is an autosome, then euploidy is the case in which     each parent contributes exactly one copy, i.e., χ^(M)={φ₁} and     χ^(F)={θ₁}. But euploidy is only one of the 3×3=9 possible cases.     The remaining eight are all different kinds of aneuploidy. For     example, in the case of maternal trisomy resulting from an M2 copy     error, one would have χ^(M)={φ₁,φ₁} and χ^(F)={θ₁}. In the case of     maternal trisomy resulting from an M1 copy error, one would have     χ^(M)={φ₁,φ₂} and χ^(F)={θ₁}. (χ^(M),χ^(F))εn will be used to     indicate the set of sub-hypothesis pairs (χ^(M),χ^(F)) that are     consistent with the copy number n. χ_(k) ^(M) will be used to denote     {φ_(1,k), . . . , φ_(n) _(M) _(,k)}, the multiset of crossover map     values restricted to the k-th SNP, and similarly for χ^(F). χ_(k)     ^(M)(m₁,m₂) is used to mean the multiset of allele values     {φ_(1,k)(m₁,m₂), . . . , φ_(n) _(M) _(,k)(m₁,m₂)}={m_(φ) _(s,k) , .     . . , m_(φ) _(n) _(M) _(,k) }. Keep in mind that φ_(l,k)ε{1,2}. -   14. Ψ is the crossover map that resulted in the measured sperm from     the father. Thus s₁=ψ(f₁,f₂). Note that it is not necessary to     consider a crossover multiset because it is assumed that the     measured sperm is euploid. ψ_(k) will be used to denote the value of     this crossover map at the k-th SNP. -   15. Keeping in mind the previous two definitions, let {e₁ ^(M), . .     . , e_(n) _(M) ^(M)} be the multiset of true but unknown haploid     sequences contributed to the embryo by the mother at this     chromosome. Specifically, e_(l) ^(M)=φ_(l)(m₁,m₂), where φ_(l) is     the l-th element of the multiset χ^(M), and e_(lk) ^(M) is the     allele value at the k-th snp. Similarly, let {e₁ ^(F), . . . , e_(n)     _(F) ^(F)} be the multiset of true but unknown haploid sequences     contributed to the embryo by the father at this chromosome. Then     e_(l) ^(F)=θ_(l)(f₁,f₂), where θ_(l) is the l-th element of the     multiset χ^(F), and f_(lk) ^(M) is the allele value at the k-th SNP.     Also, {e₁ ^(M), . . . , e_(n) _(M) ^(M)}=χ^(M)(m₁,m₂), and {e₁ ^(F),     . . . , e_(n) _(F) ^(F)}=χ^(F)(f₁,f₂) may be written. -   16. P(ĝ_(k)|χ_(k) ^(M)(m₁,m₂),χ_(k) ^(F)(f₁,f₂),p_(d),p_(a)) denotes     the probability of the genotype measurement on the embryo at SNP k     given a hypothesized true underlying genotype on the embryo and     given hypothesized underlying dropout and dropin rates. Note that     χ_(k) ^(M)(m₁,m₂) and χ_(k) ^(F)(f₁,f₂) are both multisets, so are     capable of expressing aneuploid genotypes. For example, χ_(k)     ^(M)(m₁,m₂)={A,A} and χ_(k) ^(F)(f₁,f₂)={B} expresses the maternal     trisomic genotype AAB.

Note that in this method, the measurements on the mother and father are treated as known truth, while in other places in this disclosure they are treated simply as measurements. Since the measurements on the parents are very precise, treating them as though they are known truth is a reasonable approximation to reality. They are treated as known truth here in order to demonstrate how such an assumption is handled, although it should be clear to one skilled in the art how the more precise method, used elsewhere in the patent, could equally well be used.

Solution

$\mspace{20mu} {\hat{n} = {\underset{n}{\arg \; \max}{P\left( {n,D,M,F,S} \right)}}}$ ${P\left( {n,D,M,F,S} \right)} = {{\sum\limits_{{({\chi^{M},\chi^{F}})} \in n}{\sum\limits_{\psi}{P\left( {\chi^{M},\chi^{F},\psi,D,M,F,S} \right)}}} = {{\sum\limits_{{({\chi^{M},\chi^{F}})} \in n}{{P\left( \chi^{M} \right)}{P\left( \chi^{F} \right)}{\sum\limits_{\psi}{{P(\psi)}{\int{{f\left( p_{d} \right)}{\int{{f\left( p_{a} \right)}\ {\prod\limits_{k}{{p\left( {{\hat{g}}_{k},g_{k}^{M},g_{k}^{F},\left. {\hat{g}}_{k}^{S} \middle| \chi_{k}^{M} \right.,\chi_{k}^{F},\psi_{k},p_{d},p_{a}} \right)}{p_{d}}{p_{a}}}}}}}}}}}} = {\sum\limits_{{({\chi^{M},\chi^{F}})} \in B}{{P\left( \chi^{M} \right)}{P\left( \chi^{F} \right)}{\sum\limits_{\psi}{{P(\psi)}{\int{{f\left( p_{d} \right)}{\int{{f\left( p_{a} \right)} \times {\prod\limits_{k}{\sum\limits_{{({f_{1},f_{2}})} \in g_{k}^{F}}{{P\left( f_{1} \right)}{P\left( f_{2} \right)}{P\left( {\left. {\hat{g}}_{k}^{S} \middle| {\psi_{k}\left( {f_{1},f_{2}} \right)} \right.,p_{d},p_{a}} \right)}{\sum\limits_{{({m_{1},m_{2}})} \in g_{k}^{M}}{{P\left( m_{1} \right)}{P\left( m_{1} \right)}{P\left( {\left. {\hat{g}}_{k} \middle| {\chi_{k}^{M}\left( {m_{1},m_{2}} \right)} \right.,{\chi_{k}^{F}\left( {f_{1},f_{2}} \right)},p_{d},p_{a}} \right)}{p_{d}}{p_{a}}}}}}}}}}}}}}}}}$

How to calculate each of the probabilities appearing in the last equation above has been described elsewhere in this disclosure. A method to calculate each of the probabilities appearing in the last equation above has also been described elsewhere in this disclosure. Although multiple sperm can be added in order to increase reliability of the copy number call, in practice one sperm is typically sufficient. This solution is computationally tractable for a small number of sperm.

H Simplified Method Using Only Polar Homozygotes

In another embodiment of the invention, a similar method to determine the number of copies of a chromosome can be implemented using a limited subset of SNPs in a simplified approach. The method is purely qualitative, uses parental data, and focuses exclusively on a subset of SNPs, the so-called polar homozygotes (described below). Polar homozygotic denotes the situation in which the mother and father are both homozygous at a SNP, but the homozygotes are opposite, or different allele values. Thus, the mother could be AA and the father BB, or vice versa. Since the actual allele values are not important—only their relationship to each other, i.e. opposites—the mother's alleles will be referred to as MM, and the father's as FF. In such a situation, if the embryo is euploid, it must be heterozygous at that allele. However, due to allele dropouts, a heterozygous SNP in the embryo may not be called as heterozygous. In fact, given the high rate of dropout associated with single cell amplification, it is far more likely to be called as either MM or FF, each with equal probability.

In this method, the focus is solely on those loci on a particular chromosome that are polar homozygotes and for which the embryo, which is therefore known to be heterozygous, but is nonetheless called homozygous. It is possible to form the statistic |MM|/(|MM|+|FF|), where |MM| is the number of these SNPs that are called MM in the embryo and |FF| is the number of these SNPs that are called FF in the embryo.

Under the hypothesis of euploidy, |MM|)/(|MM|+|FF|) is Gaussian in nature, with mean ½ and variance ¼N, where N=(|MM|+|FF|). Therefore the statistic is completely independent of the dropout rate, or, indeed, of any other factors. Due to the symmetry of the construction, the distribution of this statistic under the hypothesis of euploidy is known.

Under the hypothesis of trisomy, the statistic will not have a mean of ½. If, for example, the embryo has MMF trisomy, then the homozygous calls in the embryo will lean toward MM and away from FF, and vice versa. Note that because only loci where the parents are homozygous are under consideration, there is no need to distinguish M1 and M2 copy errors. In all cases, if the mother contributes 2 chromosomes instead of 1, they will be MM regardless of the underlying cause, and similarly for the father. The exact mean under trisomy will depend upon the dropout rate, p, but in no case will the mean be greater than ⅓, which is the limit of the mean as p goes to 1. Under monosomy, the mean would be precisely 0, except for noise induced by allele dropins.

In this embodiment, it is not necessary to model the distribution under aneuploidy, but only to reject the null hypothesis of euploidy, whose distribution is completely known. Any embryo for which the null hypothesis cannot be rejected at a predetermined significance level would be deemed normal.

In another embodiment of the invention, of the homozygotic loci, those that result in no-call (NC) on the embryo contain information, and can be included in the calculations, yielding more loci for consideration. In another embodiment, those loci that are not homozygotic, but rather follow the pattern AA|AB, can also be included in the calculations, yielding more loci for consideration. It should be obvious to one skilled in the art how to modify the method to include these additional loci into the calculation.

I Reduction to Practice of the PS Method as Applied to Allele Calling

In order to demonstrate a reduction to practice of the PS method as applied to cleaning the genetic data of a target individual, and its associated allele-call confidences, extensive Monte-Carlo simulations were run. The PS method's confidence numbers match the observed rate of correct calls in simulation. The details of these simulations are given in separate documents whose benefits are claimed by this disclosure. In addition, this aspect of the PS method has been reduced to practice on real triad data (a mother, a father and a born child). Results are shown below in Table 8. The TAQMAN assay was used to measure single cell genotype data consisting of diploid measurements of a large buccal sample from the father (columns p₁,p₂), diploid measurements of a buccal sample from the mother (m₁,m₂), haploid measurements on three isolated sperm from the father (h₁,h₂,h₃), and diploid measurements of four single cells from a buccal sample from the born child of the triad. Note that all diploid data are unordered. All SNPs are from chromosome 7 and within 2 megabases of the CFTR gene, in which a defect causes cystic fibrosis.

The goal was to estimate (in E1,E2) the alleles of the child, by running PS on the measured data from a single child buccal cell (e1,e2), which served as a proxy for a cell from the embryo of interest. Since no maternal haplotype sequence was available, the three additional single cells of the child sample—(b11,b12), (b21,b22), (b22,b23), were used in the same way that additional blastomeres from other embryos are used to infer maternal haplotype once the paternal haplotype is determined from sperm. The true allele values (T1,T2) on the child are determined by taking three buccal samples of several thousand cells, genotyping them independently, and only choosing SNPs on which the results were concordant across all three samples. This process yielded 94 concordant SNPs. Those loci that had a valid genotype call, according to the ABI 7900 reader, on the child cell that represented the embryo, were then selected. For each of these 69 SNPs, the disclosed method determined de-noised allele calls on the embryo (E₁,E₂), as well as the confidence associated with each genotype call.

Twenty (29%) of the 69 raw allele calls in uncleaned genetic data from the child cell were incorrect (shaded in column e1 and e2, Table 8). Columns (E₁,E₂) show that PS corrected 18 of these (shaded in column E1 and E1, but not in column ‘conf’, Table 8), while two remained miscalled (2.9% error rate; shaded in column ‘conf’, Table 8). Note that the two SNPs that were miscalled had low confidences of 53.8% and 74.4%. These low confidences indicate that the calls might be incorrect, due either to a lack of data or to inconsistent measurements on multiple sperm or “blastomeres.” The confidence in the genotype calls produced is an integral part of the PS report. Note that this demonstration, which sought to call the genotype of 69 SNPs on a chromosome, was more difficult than that encountered in practice, where the genotype at only one or two loci will typically be of interest, based on initial screening of parents' data. In some embodiments, the disclosed method may achieve a higher level of accuracy at loci of interest by: i) continuing to measure single sperm until multiple haploid allele calls have been made at the locus of interest; ii) including additional blastomere measurements; iii) incorporating maternal haploid data from extruded polar bodies, which are commonly biopsied in pre-implantation genetic diagnosis today. It should be obvious to one skilled in the art that there exist other modifications to the method that can also increase the level of accuracy, as well as how to implement these, without changing the essential concept of the disclosure.

J Reduction to Practice of the PS Method as Applied to Calling Aneuploidy

To demonstrate the reduction to practice of certain aspects of the invention disclosed herein, the method was used to call aneuploidy on several sets of single cells. In this case, only selected data from the genotyping platform was used: the genotype information from parents and embryo. A simple genotyping algorithm, called “pie slice”, was used, and it showed itself to be about 99.9% accurate on genomic data. It is less accurate on MDA data, due to the noise inherent in MDA. It is more accurate when there is a fairly high “dropout” rate in MDA. It also depends, crucially, on being able to model the probabilities of various genotyping errors in terms of parameters known as dropout rate and dropin rate.

The unknown chromosome copy numbers are inferred because different copy numbers interact differently with the dropout rate, dropin rate, and the genotyping algorithm. By creating a statistical model that specifies how the dropout rate, dropin rate, chromosome copy numbers, and genotype cutoff-threshold all interact, it is possible to use standard statistical inference methods to tease out the unknown chromosome copy numbers.

The method of aneuploidy detection described here is termed qualitative CNC, or qCNC for short, and employs the basic statistical inferencing methods of maximum-likelihood estimation, maximum-a-posteriori estimation, and Bayesian inference. The methods are very similar, with slight differences. The methods described here are similar to those described previously, and are summarized here for the sake of convenience.

Maximum Likelihood (ML)

Let X₁, . . . , X_(n)˜f(x;θ). Here the X_(i) are independent, identically distributed random variables, drawn according to a probability distribution that belongs to a family of distributions parameterized by the vector θ. For example, the family of distributions might be the family of all Gaussian distributions, in which case θ=(μ,σ) would be the mean and variance that determine the specific distribution in question. The problem is as follows: θ is unknown, and the goal is to get a good estimate of it based solely on the observations of the data X₁, . . . , X_(n). The maximum likelihood solution is given by

$\overset{\sim}{\theta} = {\underset{\theta}{\arg \; \max}{\prod\limits_{i}{f\left( {X_{i};\theta} \right)}}}$

Maximum A′ Posteriori (MAP) Estimation

Posit a prior distribution f(θ) that determines the prior probability of actually seeing θ as the parameter, allowing us to write X₁, . . . , X_(n)˜f(x|θ). The MAP solution is given by

$\overset{\sim}{\theta} = {\underset{\theta}{{\arg \; \max}\;}{f(\theta)}{\prod\limits_{i}\left( {f\left( X_{i} \middle| \theta \right)} \right.}}$

Note that the ML solution is equivalent to the MAP solution with a uniform (possibly improper) prior.

Bayesian Inference

Bayesian inference comes into play when θ=(θ₁, . . . , θ_(a)) is multidimensional but it is only necessary to estimate a subset (typically one) of the parameters θ_(j). In this case, if there is a prior on the parameters, it is possible to integrate out the other parameters that are not of interest. Without loss of generality, suppose that θ₁ is the parameter for which an estimate is desired. Then the Bayesian solution is given by:

${\overset{\sim}{\theta}}_{1} = {\underset{\theta_{1}}{\arg \; \max}\; {f\left( \theta_{1} \right)}{\int{{f\left( \theta_{2} \right)}\mspace{14mu} \ldots \mspace{14mu} {f\left( \theta_{d} \right)}{\prod\limits_{i}\left( {{f\left( X_{i} \middle| \theta \right)}\mspace{14mu} {\; \theta_{2}}\mspace{14mu} \ldots \mspace{14mu} {\; \theta_{d}}} \right.}}}}$

Copy Number Classification

Any one or some combination of the above methods may be used to determine the copy number count, as well as when making allele calls such as in the cleaning of embryonic genetic data. In one embodiment, the data may come from INFINIUM platform measurements {(x_(jk),y_(jk))}, where x_(jk) is the platform response on channel X to SNP k of chromosome j, and y_(jk) is the platform response on channel Y to SNP k of chromosome j. The key to the usefulness of this method lies in choosing the family of distributions from which it is postulated that these data are drawn. In one embodiment, that distribution is parameterized by many parameters. These parameters are responsible for describing things such as probe efficiency, platform noise, MDA characteristics such as dropout, dropin, and overall amplification mean, and, finally, the genetic parameters: the genotypes of the parents, the true but unknown genotype of the embryo, and, of course, the parameters of interest: the chromosome copy numbers supplied by the mother and father to the embryo.

In one embodiment, a good deal of information is discarded before data processing.

The advantage of doing this is that it is possible to model the data that remains in a more robust manner. Instead of using the raw platform data {(x_(jk),y_(jk))}, it is possible to pre-process the data by running the genotyping algorithm on the data. This results in a set of genotype calls {g_(jk)}, where g_(jk)ε{NC,AA,AB,BB}. NC stands for “no-call”. Putting these together into the Bayesian inference paradigm above yields:

${\hat{n}}_{j}^{M},{{\hat{n}}_{j}^{F} = {\max\limits_{n^{M},n^{F}}{\int{\int{{f\left( p_{d} \right)}{f\left( p_{a} \right)}{\prod\limits_{k}{{p\left( {\left. g_{jk} \middle| n^{M} \right.,n^{F},M_{j},F_{j},p_{d},p_{a}} \right)}{p_{d}}{p_{a}}}}}}}}}$

Explanation of the Notation:

{circumflex over (n)}_(j) ^(M),{circumflex over (n)}_(j) ^(F) are the estimated number of chromosome copies supplied to the embryo by the mother and father respectively. These should sum to 2 for the autosomes, in the case of euploidy, i.e., each parent should supply exactly 1 chromosome.

p_(d) and p_(a) are the dropout and dropin rates for genotyping, respectively. These reflect some of the modeling assumptions. It is known that in single-cell amplification, some SNPs “drop out”, which is to say that they are not amplified and, as a consequence, do not show up when the SNP genotyping is attempted on the INFINIUM platform. This phenomenon is modeled by saying that each allele at each SNP “drops out” independently with probability p_(d) during the MDA phase. Similarly, the platform is not a perfect measurement instrument. Due to measurement noise, the platform sometimes picks up a ghost signal, which can be modeled as a probability of dropin that acts independently at each SNP with probability p_(a).

M_(j),F_(j) are the true genotypes on the mother and father respectively. The true genotypes are not known perfectly, but because large samples from the parents are genotyped, one may make the assumption that the truth on the parents is essentially known.

Probe Modeling

In one embodiment of the invention, platform response models, or error models, that vary from one probe to another can be used without changing the essential nature of the invention. The amplification efficiency and error rates caused by allele dropouts, allele dropins, or other factors, may vary between different probes. In one embodiment, an error transition matrix can be made that is particular to a given probe. Platform response models, or error models, can be relevant to a particular probe or can be parameterized according to the quantitative measurements that are performed, so that the response model or error model is therefore specific to that particular probe and measurement.

Genotyping

Genotyping also requires an algorithm with some built-in assumptions. Going from a platform response (x,y) to a genotype q requires significant calculation. It is essentially requires that the positive quadrant of the x/y plane be divided into those regions where AA, AB, BB, and NC will be called. Furthermore, in the most general case, it may be useful to have regions where AAA, AAB, etc., could be called for trisomies.

In one embodiment, use is made of a particular genotyping algorithm called the pie-slice algorithm, because it divides the positive quadrant of the x/y plane into three triangles, or “pie slices”. Those (x,y) points that fall in the pie slice that hugs the X axis are called AA, those that fall in the slice that hugs the Y axis are called BB, and those in the middle slice are called AB. In addition, a small square is superimposed whose lower-left corner touches the origin. (x,y) points falling in this square are designated NC, because both x and y components have small values and hence are unreliable.

The width of that small square is called the no-call threshold and it is a parameter of the genotyping algorithm. In order for the dropin/dropout model to correctly model the error transition matrix associated with the genotyping algorithm, the cutoff threshold must be tuned properly. The error transition matrix indicates for each true-genotype/called-genotype pair, the probability of seeing the called genotype given the true genotype. This matrix depends on the dropout rate of the MDA and upon the no-call threshold set for the genotyping algorithm.

Note that a wide variety of different allele calling, or genotyping, algorithms may be used without changing the fundamental concept of the invention. For example, the no-call region could be defined by a many different shapes besides a square, such as for example a quarter circle, and the no call thresholds may vary greatly for different genotyping algorithms.

Results of Aneuploidy Calling Experiments

Presented here are experiments that demonstrate the reduction to practice of the method disclosed herein to correctly call ploidy of single cells. The goal of this demonstration was twofold: first, to show that the disclosed method correctly calls the cell's ploidy state with high confidence using samples with known chromosome copy numbers, both euploid and aneuploid, as controls, and second to show that the method disclosed herein calls the cell's ploidy state with high confidence using blastomeres with unknown chromosome copy numbers.

In order to increase confidences, the ILLUMINA INFINIUM II platform, which allows measurement of hundreds of thousands of SNPs was used. In order to run this experiment in the context of PGD, the standard INFINIUM II protocol was reduced from three days to 20 hours. Single cell measurements were compared between the full and accelerated INFINIUM II protocols, and showed ˜85% concordance. The accelerated protocol showed an increase in locus drop-out (LDO) rate from <1% to 5-10%; however, because hundreds of thousands of SNPs are measured and because PS accommodates allele dropouts, this increase in LDO rate does not have a significant negative impact on the results.

The entire aneuploidy calling method was performed on eight known-euploid buccal cells isolated from two healthy children from different families, ten known-trisomic cells isolated from a human immortalized trisomic cell line, and six blastomeres with an unknown number of chromosomes isolated from three embryos donated to research. Half of each set of cells was analyzed by the accelerated 20-hour protocol, and the other half by the standard protocol. Note that for the immortalized trisomic cells, no parent data was available. Consequently, for these cells, a pair of pseudo-parental genomes was generated by drawing their genotypes from the conditional distribution induced by observation of a large tissue sample of the trisomic genotype at each locus.

Where truth was known, the method correctly called the ploidy state of each chromosome in each cell with high confidence. The data are summarized below in three tables. Each table shows the chromosome number in the first column, and each pair of color-matched columns represents the analysis of one cell with the copy number call on the left and the confidence with which the call is made on the right. Each row corresponds to one particular chromosome. Note that these tables contain the ploidy information of the chromosomes in a format that could be used for the report that is provided to the doctor to help in the determination of which embryos are to be selected for transfer to the prospective mother. (Note ‘1’ may result from both monosomy and uniparental disomy.) Table 9 shows the results for eight known-euploid buccal cells; all were correctly found to be euploid with high confidences (>0.99). Table 10 shows the results for ten known-trisomic cells (trisomic at chromosome 21); all were correctly found to be trisomic at chromosome 21 and disomic at all other chromosomes with high confidences (>0.92). Table 11 shows the results for six blastomeres isolated from three different embryos. While no truth models exist for donated blastomeres, it is possible to look for concordance between blastomeres originating from a single embryo, however, the frequency and characteristics of mosaicism in human embryos are not currently known, and thus the presence or lack of concordance between blastomeres from a common embryo is not necessarily indicative of correct ploidy determination. The first three blastomeres are from one embryo (e1) and of those, the first two (e1b1 and e1b3) have the same ploidy state at all chromosomes except one. The third cell (e1b6) is complex aneuploid. Both blastomeres from the second embryo were found to be monosomic at all chromosomes. The blastomere from the third embryo was found to be complex aneuploid. Note that some confidences are below 90%, however, if the confidences of all aneuploid hypotheses are combined, all chromosomes are called either euploid or aneuploid with confidence exceeding 92.8%.

K Laboratory Techniques

There are many techniques available allowing the isolation of cells and DNA fragments for genotyping, as well as for the subsequent genotyping of the DNA. The system and method described here can be applied to any of these techniques, specifically those involving the isolation of fetal cells or DNA fragments from maternal blood, or blastomeres from embryos in the context of IVF. It can be equally applied to genomic data in silico, i.e. not directly measured from genetic material. In one embodiment of the system, this data can be acquired as described below. This description of techniques is not meant to be exhaustive, and it should be clear to one skilled in the arts that there are other laboratory techniques that can achieve the same ends.

Isolation of Cells

Adult diploid cells can be obtained from bulk tissue or blood samples. Adult diploid single cells can be obtained from whole blood samples using FACS, or fluorescence activated cell sorting. Adult haploid single sperm cells can also be isolated from a sperm sample using FACS. Adult haploid single egg cells can be isolated in the context of egg harvesting during IVF procedures.

Isolation of the target single cell blastomeres from human embryos can be done using techniques common in in vitro fertilization clinics, such as embryo biopsy. Isolation of target fetal cells in maternal blood can be accomplished using monoclonal antibodies, or other techniques such as FACS or density gradient centrifugation.

DNA extraction also might entail non-standard methods for this application. Literature reports comparing various methods for DNA extraction have found that in some cases novel protocols, such as the using the addition of N-lauroylsarcosine, were found to be more efficient and produce the fewest false positives.

Amplification of Genomic DNA

Amplification of the genome can be accomplished by multiple methods including: ligation-mediated PCR (LM-PCR), degenerate oligonucleotide primer PCR (DOP-PCR), and multiple displacement amplification (MDA). Of the three methods, DOP-PCR reliably produces large quantities of DNA from small quantities of DNA, including single copies of chromosomes; this method may be most appropriate for genotyping the parental diploid data, where data fidelity is critical. MDA is the fastest method, producing hundred-fold amplification of DNA in a few hours; this method may be most appropriate for genotyping embryonic cells, or in other situations where time is of the essence.

Background amplification is a problem for each of these methods, since each method would potentially amplify contaminating DNA. Very tiny quantities of contamination can irreversibly poison the assay and give false data. Therefore, it is critical to use clean laboratory conditions, wherein pre- and post-amplification workflows are completely, physically separated. Clean, contamination free workflows for DNA amplification are now routine in industrial molecular biology, and simply require careful attention to detail.

Genotyping Assay and Hybridization

The genotyping of the amplified DNA can be done by many methods including MOLECULAR INVERSION PROBES (MIPs) such as AFFYMETRIX's GENFLEX TAG Array, microarrays such as AFFYMETRIX's 500K array or the ILLUMINA BEAD ARRAYS, or SNP genotyping assays such as APPLIEDBIOSCIENCE's TAQMAN assay. The AFFYMETRIX 500K array, MIPs/GENFLEX, TAQMAN and ILLUMINA assay all require microgram quantities of DNA, so genotyping a single cell with either workflow would require some kind of amplification. Each of these techniques has various tradeoffs in terms of cost, quality of data, quantitative vs. qualitative data, customizability, time to complete the assay and the number of measurable SNPs, among others. An advantage of the 500K and ILLUMINA arrays are the large number of SNPs on which it can gather data, roughly 250,000, as opposed to MIPs which can detect on the order of 10,000 SNPs, and the TAQMAN assay which can detect even fewer. An advantage of the MIPs, TAQMAN and ILLUMINA assay over the 500K arrays is that they are inherently customizable, allowing the user to choose SNPs, whereas the 500K arrays do not permit such customization.

In the context of pre-implantation diagnosis during IVF, the inherent time limitations are significant; in this case it may be advantageous to sacrifice data quality for turn-around time. Although it has other clear advantages, the standard MIPs assay protocol is a relatively time-intensive process that typically takes 2.5 to three days to complete. In MIPs, annealing of probes to target DNA and post-amplification hybridization are particularly time-intensive, and any deviation from these times results in degradation in data quality. Probes anneal overnight (12-16 hours) to DNA sample. Post-amplification hybridization anneals to the arrays overnight (12-16 hours). A number of other steps before and after both annealing and amplification bring the total standard timeline of the protocol to 2.5 days. Optimization of the MIPs assay for speed could potentially reduce the process to fewer than 36 hours. Both the 500K arrays and the ILLUMINA assays have a faster turnaround: approximately 1.5 to two days to generate highly reliable data in the standard protocol. Both of these methods are optimizable, and it is estimated that the turn-around time for the genotyping assay for the 500 k array and/or the ILLUMINA assay could be reduced to less than 24 hours. Even faster is the TAQMAN assay which can be run in three hours. For all of these methods, the reduction in assay time will result in a reduction in data quality, however that is exactly what the disclosed invention is designed to address.

Naturally, in situations where the timing is critical, such as genotyping a blastomere during IVF, the faster assays have a clear advantage over the slower assays, whereas in cases that do not have such time pressure, such as when genotyping the parental DNA before IVF has been initiated, other factors will predominate in choosing the appropriate method. For example, another tradeoff that exists from one technique to another is one of price versus data quality. It may make sense to use more expensive techniques that give high quality data for measurements that are more important, and less expensive techniques that give lower quality data for measurements where the fidelity is not as critical. Any techniques which are developed to the point of allowing sufficiently rapid high-throughput genotyping could be used to genotype genetic material for use with this method.

Methods for Simultaneous Targeted Locus Amplification and Whole Genome Amplification.

During whole genome amplification of small quantities of genetic material, whether through ligation-mediated PCR (LM-PCR), multiple displacement amplification (MDA), or other methods, dropouts of loci occur randomly and unavoidably. It is often desirable to amplify the whole genome nonspecifically, but to ensure that a particular locus is amplified with greater certainty. It is possible to perform simultaneous locus targeting and whole genome amplification.

In a preferred embodiment, the basis for this method is to combine standard targeted polymerase chain reaction (PCR) to amplify particular loci of interest with any generalized whole genome amplification method. This may include, but is not limited to: preamplification of particular loci before generalized amplification by MDA or LM-PCR, the addition of targeted PCR primers to universal primers in the generalized PCR step of LM-PCR, and the addition of targeted PCR primers to degenerate primers in MDA.

L Notes

As noted previously, given the benefit of this disclosure, there are more embodiments that may implement one or more of the systems, methods, and features, disclosed herein.

In all cases concerning the determination of the probability of a particular qualitative measurement on a target individual based on parent data, it should be obvious to one skilled in the art, after reading this disclosure, how to apply a similar method to determine the probability of a quantitative measurement of the target individual rather than qualitative. Wherever genetic data of the target or related individuals is treated qualitatively, it will be clear to one skilled in the art, after reading this disclosure, how to apply the techniques disclosed to quantitative data.

It should be obvious to one skilled in the art that a plurality of parameters may be changed without changing the essence of the invention. For example, the genetic data may be obtained using any high throughput genotyping platform, or it may be obtained from any genotyping method, or it may be simulated, inferred or otherwise known. A variety of computational languages could be used to encode the algorithms described in this disclosure, and a variety of computational platforms could be used to execute the calculations. For example, the calculations could be executed using personal computers, supercomputers, a massively parallel computing platform, or even non-silicon based computational platforms such as a sufficiently large number of people armed with abacuses.

Some of the math in this disclosure makes hypotheses concerning a limited number of states of aneuploidy. In some cases, for example, only monosomy, disomy and trisomy are explicitly treated by the math. It should be obvious to one skilled in the art how these mathematical derivations can be expanded to take into account other forms of aneuploidy, such as nullsomy (no chromosomes present), quadrosomy, etc., without changing the fundamental concepts of the invention.

When this disclosure discusses a chromosome, this may refer to a segment of a chromosome, and when a segment of a chromosome is discussed, this may refer to a full chromosome. It is important to note that the math to handle a segment of a chromosome is the same as that needed to handle a full chromosome. It should be obvious to one skilled in the art how to modify the method accordingly

It should be obvious to one skilled in the art that a related individual may refer to any individual who is genetically related, and thus shares haplotype blocks with the target individual. Some examples of related individuals include: biological father, biological mother, son, daughter, brother, sister, half-brother, half-sister, grandfather, grandmother, uncle, aunt, nephew, niece, grandson, granddaughter, cousin, clone, the target individual himself/herself/itself, and other individuals with known genetic relationship to the target. The term ‘related individual’ also encompasses any embryo, fetus, sperm, egg, blastomere, blastocyst, or polar body derived from a related individual.

It is important to note that the target individual may refer to an adult, a juvenile, a fetus, an embryo, a blastocyst, a blastomere, a cell or set of cells from an individual, or from a cell line, or any set of genetic material. The target individual may be alive, dead, frozen, or in stasis.

It is also important to note that where the target individual refers to a blastomere that is used to diagnose an embryo, there may be cases caused by mosaicism where the genome of the blastomere analyzed does not correspond exactly to the genomes of all other cells in the embryo.

It is important to note that it is possible to use the method disclosed herein in the context of cancer genotyping and/or karyotyping, where one or more cancer cells is considered the target individual, and the non-cancerous tissue of the individual afflicted with cancer is considered to be the related individual. The non-cancerous tissue of the individual afflicted with the target could provide the set of genotype calls of the related individual that would allow chromosome copy number determination of the cancerous cell or cells using the methods disclosed herein.

It is important to note that the method described herein concerns the cleaning of genetic data, and as all living or once living creatures contain genetic data, the methods are equally applicable to any live or dead human, animal, or plant that inherits or inherited chromosomes from other individuals.

It is important to note that in many cases, the algorithms described herein make use of prior probabilities, and/or initial values. In some cases the choice of these prior probabilities may have an impact on the efficiency and/or effectiveness of the algorithm. There are many ways that one skilled in the art, after reading this disclosure, could assign or estimate appropriate prior probabilities without changing the essential concept of the patent.

It is also important to note that the embryonic genetic data that can be generated by measuring the amplified DNA from one blastomere can be used for multiple purposes. For example, it can be used for detecting aneuploidy, uniparental disomy, sexing the individual, as well as for making a plurality of phenotypic predictions based on phenotype-associated alleles. Currently, in IVF laboratories, due to the techniques used, it is often the case that one blastomere can only provide enough genetic material to test for one disorder, such as aneuploidy, or a particular monogenic disease. Since the method disclosed herein has the common first step of measuring a large set of SNPs from a blastomere, regardless of the type of prediction to be made, a physician, parent, or other agent is not forced to choose a limited number of disorders for which to screen. Instead, the option exists to screen for as many genes and/or phenotypes as the state of medical knowledge will allow. With the disclosed method, one advantage to identifying particular conditions to screen for prior to genotyping the blastomere is that if it is decided that certain loci are especially relevant, then a more appropriate set of SNPs which are more likely to cosegregate with the locus of interest, can be selected, thus increasing the confidence of the allele calls of interest.

It is also important to note that it is possible to perform haplotype phasing by molecular haplotyping methods. Because separation of the genetic material into haplotypes is challenging, most genotyping methods are only capable of measuring both haplotypes simultaneously, yielding diploid data. As a result, the sequence of each haploid genome cannot be deciphered. In the context of using the disclosed method to determine allele calls and/or chromosome copy number on a target genome, it is often helpful to know the maternal haplotype; however, it is not always simple to measure the maternal haplotype. One way to solve this problem is to measure haplotypes by sequencing single DNA molecules or clonal populations of DNA molecules. The basis for this method is to use any sequencing method to directly determine haplotype phase by direct sequencing of a single DNA molecule or clonal population of DNA molecules. This may include, but not be limited to: cloning amplified DNA fragments from a genome into a recombinant DNA constructs and sequencing by traditional dye-end terminator methods, isolation and sequencing of single molecules in colonies, and direct single DNA molecule or clonal DNA population sequencing using next-generation sequencing methods.

The systems, methods, and techniques of the present invention may be used to in conjunction with embryo screening or prenatal testing procedures. The systems, methods, and techniques of the present invention are employed in methods of increasing the probability that the embryos and fetuses obtain by in vitro fertilization are successfully implanted and carried through the full gestation period. Further, the systems, methods, and techniques of the present invention are employed in methods of decreasing the probability that the embryos and fetuses obtain by in vitro fertilization that are implanted and gestated are not specifically at risk for a congenital disorder.

Thus, according to some embodiments, the present invention extends to the use of the systems, methods, and techniques of the invention in conjunction with pre-implantation diagnosis procedures.

According to some embodiments, the present invention extends to the use of the systems, methods, and techniques of the invention in conjunction with prenatal testing procedures.

According to some embodiments, the systems, methods, and techniques of the invention are used in methods to decrease the probability for the implantation of an embryo specifically at risk for a congenital disorder by testing at least one cell removed from early embryos conceived by in vitro fertilization and transferring to the mother's uterus only those embryos determined not to have inherited the congenital disorder.

According to some embodiments, the systems, methods, and techniques of the invention are used in methods to decrease the probability for the implantation of an embryo specifically at risk for a chromosome abnormality by testing at least one cell removed from early embryos conceived by in vitro fertilization and transferring to the mother's uterus only those embryos determined not to have chromosome abnormalities.

According to some embodiments, the systems, methods, and techniques of the invention are used in methods to increase the probability of implanting an embryo obtained by in vitro fertilization that is at a reduced risk of carrying a congenital disorder.

According to some embodiments, the systems, methods, and techniques of the invention are used in methods to increase the probability of gestating a fetus.

According to preferred embodiments, the congenital disorder is a malformation, neural tube defect, chromosome abnormality, Down's syndrome (or trisomy 21), Trisomy 18, spina bifida, cleft palate, Tay Sachs disease, sickle cell anemia, thalassemia, cystic fibrosis, Huntington's disease, and/or fragile x syndrome. Chromosome abnormalities include, but are not limited to, Down syndrome (extra chromosome 21), Turner Syndrome (45×0) and Klinefelter's syndrome (a male with 2× chromosomes).

According to preferred embodiments, the malformation is a limb malformation. Limb malformations include, but are not limited to, amelia, ectrodactyly, phocomelia, polymelia, polydactyly, syndactyly, polysyndactyly, oligodactyly, brachydactyly, achondroplasia, congenital aplasia or hypoplasia, amniotic band syndrome, and cleidocranial dysostosis.

According to preferred embodiments, the malformation is a congenital malformation of the heart. Congenital malformations of the heart include, but are not limited to, patent ductus arteriosus, atrial septal defect, ventricular septal defect, and tetralogy of fallot.

According to preferred embodiments, the malformation is a congenital malformation of the nervous system. Congenital malformations of the nervous system include, but are not limited to, neural tube defects (e.g., spina bifida, meningocele, meningomyelocele, encephalocele and anencephaly), Arnold-Chiari malformation, the Dandy-Walker malformation, hydrocephalus, microencephaly, megencephaly, lissencephaly, polymicrogyria, holoprosencephaly, and agenesis of the corpus callosum.

According to preferred embodiments, the malformation is a congenital malformation of the gastrointestinal system. Congenital malformations of the gastrointestinal system include, but are not limited to, stenosis, atresia, and imperforate anus.

According to some embodiments, the systems, methods, and techniques of the invention are used in methods to increase the probability of implanting an embryo obtained by in vitro fertilization that is at a reduced risk of carrying a predisposition for a genetic disease.

According to preferred embodiments, the genetic disease is either monogenic or multigenic. Genetic diseases include, but are not limited to, Bloom Syndrome, Canavan Disease, Cystic fibrosis, Familial Dysautonomia, Riley-Day syndrome, Fanconi Anemia (Group C), Gaucher Disease, Glycogen storage disease 1a, Maple syrup urine disease, Mucolipidosis IV, Niemann-Pick Disease, Tay-Sachs disease, Beta thalessemia, Sickle cell anemia, Alpha thalessemia, Beta thalessemia, Factor XI Deficiency, Friedreich's Ataxia, MCAD, Parkinson disease-juvenile, Connexin26, SMA, Rett syndrome, Phenylketonuria, Becker Muscular Dystrophy, Duchennes Muscular Dystrophy, Fragile X syndrome, Hemophilia A, Alzheimer dementia—early onset, Breast/Ovarian cancer, Colon cancer, Diabetes/MODY, Huntington disease, Myotonic Muscular Dystrophy, Parkinson Disease—early onset, Peutz-Jeghers syndrome, Polycystic Kidney Disease, Torsion Dystonia

Combinations of the Aspects of the Invention

As noted previously, given the benefit of this disclosure, there are more aspects and embodiments that may implement one or more of the systems, methods, and features, disclosed herein. Below is a short list of examples illustrating situations in which the various aspects of the disclosed invention can be combined in a plurality of ways. It is important to note that this list is not meant to be comprehensive; many other combinations of the aspects, methods, features and embodiments of this invention are possible.

In one embodiment of the invention, it is possible to combine several of the aspect of the invention such that one could perform both allele calling as well as aneuploidy calling in one step, and to use quantitative values instead of qualitative for both parts. It should be obvious to one skilled in the art how to combine the relevant mathematics without changing the essence of the invention.

In a preferred embodiment of the invention, the disclosed method is employed to determine the genetic state of one or more embryos for the purpose of embryo selection in the context of IVF. This may include the harvesting of eggs from the prospective mother and fertilizing those eggs with sperm from the prospective father to create one ore more embryos. It may involve performing embryo biopsy to isolate a blastomere from each of the embryos. It may involve amplifying and genotyping the genetic data from each of the blastomeres. It may include obtaining, amplifying and genotyping a sample of diploid genetic material from each of the parents, as well as one or more individual sperm from the father. It may involve incorporating the measured diploid and haploid data of both the mother and the father, along with the measured genetic data of the embryo of interest into a dataset. It may involve using one or more of the statistical methods disclosed in this patent to determine the most likely state of the genetic material in the embryo given the measured or determined genetic data. It may involve the determination of the ploidy state of the embryo of interest. It may involve the determination of the presence of a plurality of known disease-linked alleles in the genome of the embryo. It may involve making phenotypic predictions about the embryo. It may involve generating a report that is sent to the physician of the couple so that they may make an informed decision about which embryo(s) to transfer to the prospective mother.

Another example could be a situation where a 44-year old woman undergoing IVF is having trouble conceiving. The couple arranges to have her eggs harvested and fertilized with sperm from the man, producing nine viable embryos. A blastomere is harvested from each embryo, and the genetic data from the blastomeres are measured using an ILLUMINA INFINIUM BEAD ARRAY. Meanwhile, the diploid data are measured from tissue taken from both parents also using the ILLUMINA INFINIUM BEAD ARRAY. Haploid data from the father's sperm is measured using the same method. The method disclosed herein is applied to the genetic data of the blastomere and the diploid maternal genetic data to phase the maternal genetic data to provide the maternal haplotype. Those data are then incorporated, along with the father's diploid and haploid data, to allow a highly accurate determination of the copy number count for each of the chromosomes in each of the embryos. Eight of the nine embryos are found to be aneuploid, and the one embryo is found to be euploid. A report is generated that discloses these diagnoses, and is sent to the doctor. The report has data similar to the data found in Tables 9, 10 and 11. The doctor, along with the prospective parents, decides to transfer the euploid embryo which implants in the mother's uterus.

Another example may involve a pregnant woman who has been artificially inseminated by a sperm donor, and is pregnant. She is wants to minimize the risk that the fetus she is carrying has a genetic disease. She undergoes amniocentesis and fetal cells are isolated from the withdrawn sample, and a tissue sample is also collected from the mother. Since there are no other embryos, her data are phased using molecular haplotyping methods. The genetic material from the fetus and from the mother are amplified as appropriate and genotyped using the ILLUMINA INFINIUM BEAD ARRAY, and the methods described herein reconstruct the embryonic genotype as accurately as possible. Phenotypic susceptibilities are predicted from the reconstructed fetal genetic data and a report is generated and sent to the mother's physician so that they can decide what actions may be best.

Another example could be a situation where a racehorse breeder wants to increase the likelihood that the foals sired by his champion racehorse become champions themselves. He arranges for the desired mare to be impregnated by IVF, and uses genetic data from the stallion and the mare to clean the genetic data measured from the viable embryos. The cleaned embryonic genetic data allows the breeder to select the embryos for implantation that are most likely to produce a desirable racehorse.

Tables 1-11

-   Table 1. Probability distribution of measured allele calls given the     true genotype. -   Table 2. Probabilities of specific allele calls in the embryo using     the U and H notation. -   Table 3. Conditional probabilities of specific allele calls in the     embryo given all possible parental states. -   Table 4. Constraint Matrix (A). -   Table 5. Notation for the counts of observations of all specific     embryonic allelic states given all possible parental states. -   Table 6. Aneuploidy states (h) and corresponding P(h|n_(j)), the     conditional probabilities given the copy numbers. -   Table 7. Probability of aneuploidy hypothesis (H) conditional on     parent genotype. -   Table 8. Results of PS algorithm applied to 69 SNPs on chromosome 7 -   Table 9. Aneuploidy calls on eight known euploid cells -   Table 10. Aneuploidy calls on ten known trisomic cells -   Table 11. Aneuploidy calls for six blastomeres.

TABLE 1 Probability distribution of measured allele calls given the true genotype. p(dropout) = 0.5, p(gain) = 0.02 measured true AA AB BB XX AA 0.735 0.015 0.005 0.245 AB 0.250 0.250 0.250 0.250 BB 0.005 0.015 0.735 0.245

TABLE 2 Probabilities of specific allele calls in the embryo usingthe U and H notation. Embryo readouts Embryo truth state U H Ū Empty U p₁₁ p₁₂ p₁₃ p₁₄ H p₂₁ p₂₂ p₂₃ p₂₄

TABLE 3 Conditional probabilities of specific allele calls in the embryo given all possible parental states. Embryo readouts types and conditional Parental Expected truth state in probabilities matings the embryo U H Ū empty U × U U p₁₁ p₁₂ p₁₃ p₁₄ U × Ū H p₂₁ p₂₂ p₂₃ p₂₄ U × H 50% U, 50% H p₃₁ p₃₂ p₃₃ p₃₄ H × H 25% U, 25% Ū, 50% H p₄₁ p₄₂ p₄₃ p₄₄

TABLE 4 Constraint Matrix (A). 1 1 1 1 1 1 1 1 1 −1 −.5 −.5 1 −.5 −.5 1 −.5 −.5 1 −.5 −.5 1 −.25 −.25 −.5 1 −.5 −.5 1 −.25 −.25 −.5 1 −.5 −.5 1

TABLE 5 Notation for the counts of observations of all specific embryonic allelic states given all possible parental states. Embryo readouts types Parental Expected embryo and observed counts matings truth state U H Ū Empty U × U U n₁₁ n₁₂ n₁₃ n₁₄ U × Ū H n₂₁ n₂₂ n₂₃ n₂₄ U × H 50% U, 50% H n₃₁ n₃₂ n₃₃ n₃₄ H × H 25% U, 25% Ū, 50% H n₄₁ n₄₂ n₄₃ n₄₄

TABLE 6 Aneuploidy states (h) and corresponding P(h|n_(j)), the conditional probabilities given the copy numbers. N H P(h|n) In General 1 paternal monosomy 0.5 Ppm 1 maternal monosomy 0.5 Pmm 2 Disomy 1 1 3 paternal trisomy t1 0.5 * pt1 ppt * pt1 3 paternal trisomy t2 0.5 * pt2 ppt * pt2 3 maternal trisomy t1 0.5 * pm1 pmt * mt1 3 maternal trisomy t2 0.5 * pm2 pmt * mt2

TABLE 7 Probability of aneuploidy hypothesis (H) conditional on parent genotype. embryo allele counts hypothesis (mother, father) genotype copy # nA nC H AA, AA AA, AC AA, CC AC, AA AC, AC AC, CC CC, AA CC, AC CC, CC 1 1 0 father only 1 1 1 0.5 0.5 0.5 0 0 0 1 1 0 mother only 1 0.5 0 1 0.5 0 1 0.5 0 1 0 1 father only 0 0 0 0 0.5 0.5 1 1 1 1 0 1 mother only 0 0.5 1 0.5 0.5 1 0 0.5 1 2 2 0 disomy 1 0.5 0 0.5 0.25 0 0 0 0 2 1 1 disomy 0 0.5 1 0.5 0.5 0.5 1 0.5 0 2 0 2 disomy 0 0 0 0 0.25 0.5 0 0.5 1 3 3 0 father t1 1 0.5 0 0 0 0 0 0 0 3 3 0 father t2 1 0.5 0 0.5 0.25 0 0 0 0 3 3 0 mother t1 1 0 0 0.5 0 0 0 0 0 3 3 0 mother t2 1 0.5 0 0.5 0.25 0 0 0 0 3 2 1 father t1 0 0.5 1 1 0.5 0 0 0 0 3 2 1 father t2 0 0.5 1 0 0.25 0.5 0 0 0 3 2 1 mother t1 0 1 0 0.5 0.5 0 1 0 0 3 2 1 mother t2 0 0 0 0.5 0.25 0 1 0.5 0 3 1 2 father t1 0 0 0 0 0.5 1 1 0.5 0 3 1 2 father t2 0 0 0 0.5 0.25 0 1 0.5 0 3 1 2 mother t1 0 0 1 0 0.5 0.5 0 1 0 3 1 2 mother t2 0 0.5 1 0 0.25 0.5 0 0 0 3 0 3 father t1 0 0 0 0 0 0 0 0.5 1 3 0 3 father t2 0 0 0 0 0.25 0.5 0 0.5 1 3 0 3 mother t1 0 0 0 0 0 0.5 0 0 1 3 0 3 mother t2 0 0 0 0 0.25 0.5 0 0.5 1

TABLE 8 Results of PS algorithm applied to 69 SNPs on chromosome 7

TABLE 9 Aneuploidy calls on eight known euploid cells Chr# Cell 1 Cell 2 Cell 3 Cell 4 Cell 5 Cell 6 Cell 7 Cell 8 1 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 3 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 4 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 5 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 6 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 7 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 8 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 9 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 10 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 11 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 12 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 13 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 14 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 15 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 16 2 1.00000 2 0.99997 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 17 2 1.00000 2 0.99995 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 18 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 19 2 1.00000 2 0.99998 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 20 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 21 2 0.99993 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 22 2 1.00000 2 1.00000 2 0.99040 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 0.99992 X 1 0.99999 1 0.99994 1 1.00000 1 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000

TABLE 10 Aneuploidy calls on ten known trisomic cells Chr# Cell 1 Cell 2 Cell 3 Cell 4 Cell 5 Cell 6 Cell 7 Cell 8 Cell 9 Cell 10 1 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 3 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 4 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 5 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 6 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 7 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 0.92872 2 1.00000 8 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 9 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 10 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 11 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 12 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 13 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 14 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 15 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 0.99998 2 1.00000 16 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 0.99999 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 17 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 0.96781 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 18 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 19 2 1.00000 2 1.00000 2 0.99999 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 20 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 0.99997 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 21 3 1.00000 3 1.00000 3 1.00000 3 1.00000 3 1.00000 3 1.00000 3 1.00000 3 1.00000 3 1.00000 3 1.00000 22 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 2 1.00000 23 1 1.00000 1 1.00000 1 1.00000 1 1.00000 1 1.00000 1 1.00000 1 1.00000 1 1.00000 1 1.00000 1 1.00000

TABLE 11 Aneuploidy calls for six blastomeres. Chr # e1b1 e1b3 e1b6 e2b1 e2b2 e3b2 1 2 1.00000 2 1.00000 1 1.00000 1 1.00000 1 1.00000 3 1.00000 2 2 1.00000 2 1.00000 3 1.00000 1 1.00000 1 1.00000 2 0.99994 3 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 3 1.00000 4 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 3 1.00000 5 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 3 0.99964 6 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 3 1.00000 7 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 2 0.99866 8 2 1.00000 2 1.00000 3 0.99966 1 1.00000 1 1.00000 3 1.00000 9 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 3 0.99999 10 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 1 1.00000 11 2 1.00000 2 1.00000 3 1.00000 1 1.00000 1 1.00000 2 0.99931 12 2 1.00000 2 1.00000 2 1.00000 1 1.00000 1 1.00000 1 1.00000 13 2 1.00000 2 1.00000 3 0.98902 1 1.00000 1 1.00000 2 0.99969 14 2 1.00000 2 1.00000 2 0.99991 1 1.00000 1 1.00000 3 1.00000 15 2 1.00000 2 1.00000 2 0.99986 1 1.00000 1 1.00000 3 0.99999 16 3 1.00000 3 0.98609 2 0.74890 1 1.00000 1 1.00000 2 0.94126 17 2 1.00000 2 1.00000 2 0.97983 1 1.00000 1 1.00000 2 1.00000 18 2 1.00000 2 1.00000 2 0.98367 1 1.00000 1 1.00000 1 1.00000 19 2 1.00000 2 1.00000 4 0.64546 1 1.00000 1 1.00000 3 1.00000 20 2 1.00000 2 1.00000 3 0.58327 1 1.00000 1 1.00000 2 0.95078 21 2 0.99952 2 1.00000 2 0.97594 1 1.00000 1 1.00000 1 0.99776 22 2 1.00000 2 0.98219 2 0.99217 1 1.00000 1 0.99989 2 1.00000 23 2 1.00000 3 1.00000 3 1.00000 1 1.00000 1 1.00000 3 0.99998 24 1 0.99122 1 0.99778 1 0.99999 

1-33. (canceled)
 34. A method for determining whether a target individual has a trisomy, the method comprising: obtaining genetic data at a plurality of polymorphic loci on one or more chromosomes or chromosome segments of interest in the target individual; calculating, on a computer, expected genetic data of the target individual (i) for at least one hypothesis in which the target individual has a disomy at the chromosome or chromosome segment of interest, (ii) for at least one hypothesis in which the target individual has a trisomy at the chromosome or chromosome segment of interest wherein the two chromosomes or chromosome segments that were inherited from the same parent are identical, and (iii) for at least one hypothesis in which the target individual has a trisomy at the chromosome or chromosome segment of interest wherein the two chromosomes or chromosome segments that were inherited from the same parent are homologous but non-identical; calculating, on a computer, a fit, for each of the hypotheses, between (1) the obtained genetic data of the target individual and (2) the expected genetic data of the target individual for that hypothesis; ranking one or more of the hypotheses according to the calculated fit; and selecting the hypothesis that is ranked the highest, thereby determining whether the target individual has a trisomy.
 35. The method of claim 34, wherein the method further comprises calculating, on a computer, expected genetic data of the target individual for (iv) at least one hypothesis in which the target individual has a trisomy at the chromosome or chromosome segment of interest wherein the two chromosomes that were inherited from the same parent are identical for at least one region of the chromosome or chromosome segment of interest, and homologous but non-identical for at least one region of the chromosome or chromosome segment of interest.
 36. The method of claim 34, comprising calculating expected genetic data of the target individual (i) for at least one hypothesis in which the target individual has inherited two copies of the chromosome of interest from the father of the individual, and (ii) for at least one hypothesis in which the target individual has inherited two copies of the chromosome of interest from the mother of the individual.
 37. The method of claim 34, further comprising calculating expected genetic data of the target individual for one or more hypotheses selected from the group consisting of nullsomy, monosomy, uniparental disomy, tetrasomy, unbalanced translocations, and combinations thereof.
 38. The method of claim 34, wherein the trisomy in which the two chromosomes or chromosome segments that were inherited from the same parent are identical arises from a meiotic II nondisjunction.
 39. The method of claim 34, wherein the trisomy in which the two chromosomes or chromosome segments that were inherited from the same parent are homologous but non-identical arises from a meiotic I nondisjunction.
 40. The method of claim 35, wherein the trisomy in which the two chromosomes that were inherited from the same parent are identical for at least one region of the chromosome or chromosome segment of interest, and homologous but non-identical for at least one region of the chromosome or chromosome segment of interest arises from a meiotic II nondisjunction with one or more chromosome crossovers.
 41. The method of claim 34, wherein the expected genetic data of the target individual is calculated using the probability of one or more crossovers that may have occurred during the formation of a gamete that contributed a copy of the one or more chromosomes or chromosome segments to the target individual.
 42. The method of claim 34, wherein the expected genetic data of the target individual is calculated using obtained genetic data from one or more biological parents of the target individual at the plurality of polymorphic loci.
 43. The method of claim 34, wherein the expected genetic data of the target individual is calculated using a distribution of measurement errors for the obtained genetic data of the target individual.
 44. The method of claim 34, wherein calculating the fit comprises using a technique selected from the group consisting of maximum a-posteriori estimation, maximum likelihood estimation, and Bayesian estimation to calculate the fit between (1) the obtained genetic data of the target individual and (2) the expected genetic data of the target individual for that hypothesis.
 45. The method of claim 34, comprising determining that more than one chromosome or chromosome segment of interest in the target individual has a trisomy.
 46. The method of claim 34, wherein the plurality of loci comprises single nucleotide polymorphisms.
 47. The method of claim 34, wherein the method comprises screening for a chromosomal condition selected from the group consisting of euploidy, nullsomy, monosomy, uniparental disomy, trisomy, tetrasomy, unbalanced translocations, deletions, insertions, mosaicism, and combinations thereof.
 48. The method of claim 34, wherein the obtained genetic data of the target individual is obtained by measuring genetic material from a single cell from the target individual.
 49. The method of claim 34, wherein the obtained genetic data of the target individual is obtained by measuring DNA from the target individual found in maternal blood.
 50. The method of claim 34, wherein the target individual's genetic material has, as part of the obtaining step, been amplified using a technique selected from the group consisting of polymerase chain reaction (PCR), ligation mediated PCR, whole genome amplification, degenerative oligonucleotide primer PCR, multiple displacement amplification, targeted amplification, and combinations thereof.
 51. The method of claim 34, wherein the target individual's genetic material has, as part of the obtaining step, been measured using a tool or technique selected from the group consisting of the MOLECULAR INVERSION PROBE (MIP) assay, genotyping microarrays, the TAQMAN SNP genotyping assay, the ILLUMINA genotyping system, fluorescent in situ hybridization (FISH), sequencing, and combinations thereof.
 52. The method of claim 34, wherein the target individual's genetic data have been measured by analyzing substances selected from the group consisting of one or more diploid cells from the target individual, one or more haploid cells from the target individual, one or more blastomeres from the target individual, DNA from the target individual found in maternal blood, one or more cells from the target individual found in maternal blood, genetic material known to have originated from the target individual, and combinations thereof.
 53. The method of claim 42, wherein the one or more biological parents' genetic data have been obtained by analyzing substances selected from the group consisting of the one or more biological parents' bulk diploid tissue, one or more diploid cells from the one or more biological parents, one or more haploid cells from the one or more biological parents, one or more embryos created from a gamete from the one or more biological parents, one or more blastomeres from such an embryo, genetic material known to have originated from the one or more biological parents, and combinations thereof.
 54. The method of claim 34, wherein the target individual is an embryo, and wherein the obtained genetic data of the target individual is obtained by measuring one or more cells biopsied from the embryo.
 55. The method of claim 47, wherein the target individual is an embryo, and wherein the method further comprises using the screening for a chromosomal condition to select one or more embryos for in vitro fertilization, and performing in vitro fertilization with the selected embryo(s).
 56. The method of claim 34, wherein the target individual is a fetus, and wherein the obtained genetic data of the target individual is obtained by measuring DNA found in maternal blood.
 57. The method of claim 47, wherein the target individual is a fetus, and wherein the method further comprises using the screening for a chromosomal condition to make a clinical decision about the fetus.
 58. A report displaying a result generated using the method of claim
 34. 